Author of the publication

Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms

, and . STOC, page 91-103. ACM, (1986)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Good quantum error-correcting codes exist, and . Phys. Rev. A, (August 1996)A new relativistic orthogonal states quantum key distribution protocol., and . Quantum Inf. Comput., 14 (13-14): 1081-1088 (2014)Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol., , , , , , and . ICS, page 20-31. Tsinghua University Press, (2010)On the Structure of the Scaffolding Core of Bacteriophage T4., , , and . J. Comput. Biol., 6 (1): 1-12 (1999)The adaptive classical capacity of a quantum channel, or Information capacities of three symmetric pure states in three dimensions.. IBM J. Res. Dev., 48 (1): 115-138 (2004)Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version)., , , and . WADS, volume 382 of Lecture Notes in Computer Science, page 115-134. Springer, (1989)Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer.. SIAM Rev., 41 (2): 303-332 (1999)Upper bound on the classical capacity of a quantum channel assisted by classical feedback., , , , , and . ISIT, page 906-911. IEEE, (2021)Generalized Planar Matching., , , , and . J. Algorithms, 11 (2): 153-184 (1990)Remote preparation of quantum states., , , , and . IEEE Trans. Inf. Theory, 51 (1): 56-74 (2005)