Jay Belanger

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Reductions and convergence rates of average time Lecture Notes in Computer Science	2024-01-29	Paper
Rankable distributions do not provide harder instances than uniform distributions Lecture Notes in Computer Science	2023-12-12	Paper
Shadowy vision: spanners in the mechanization of mathematics Historia Mathematica	2005-05-12	Paper
scientific article; zbMATH DE number 1684355 (Why is no real title available?)	2003-10-21	Paper
scientific article; zbMATH DE number 1301095 (Why is no real title available?)	1999-06-15	Paper
No NP problems averaging over ranking of distributions are harder Theoretical Computer Science	1998-07-22	Paper
On the NP-isomorphism problem with respect to random instances Journal of Computer and System Sciences	1995-06-08	Paper
scientific article; zbMATH DE number 512799 (Why is no real title available?)	1994-06-02	Paper
Honest iteration schemes of randomizing algorithms Information Processing Letters	1993-06-29	Paper
scientific article; zbMATH DE number 219033 (Why is no real title available?)	1993-06-29	Paper

Research outcomes over time

This page was built for person: Jay Belanger