( en | de | ru )

 

Disambiguation of "Buhrman, Harry"

Author of the publication

copydeleteadd this publication to your clipboard
Nonrelativizing Separations.

, , and . Computational Complexity Conference, page 8-12. IEEE Computer Society, (1998)

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.

Walther Harry

Klaus-Peter Harry

Wolfram Harryers

Christoph Harryers

Fredrik Harrysson

 

Other publications of authors with the same name

Are Bitvectors Optimal?, , , and . SIAM J. Comput., 31 (6): 1723-1744 (2002)Quantum Zero-Error Algorithms Cannot be Composed, and . CoRR, (2002)Quantum Computing.. CiE, volume 3526 of Lecture Notes in Computer Science, page 68-68. Springer, (2005)Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy., and . FSTTCS, volume 652 of Lecture Notes in Computer Science, page 116-127. Springer, (1992)Bounding Quantum-Classical Separations for Classes of Nonlocal Games., , , , and . STACS, volume 126 of LIPIcs, page 12:1-12:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the Parallel Repetition of Multi-Player Games: The No-Signaling Case., , and . TQC, volume 27 of LIPIcs, page 24-35. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)One Bit of Advice., , and . STACS, volume 2607 of Lecture Notes in Computer Science, page 547-558. Springer, (2003)Near-Optimal and Explicit Bell Inequality Violations., , , and . CCC, page 157-166. IEEE Computer Society, (2011)On Computation and Communication with Small Bias., , and . CCC, page 24-32. IEEE Computer Society, (2007)Towards a Reverse Newman's Theorem in Interactive Information Complexity., , , , , and . CCC, page 24-33. IEEE Computer Society, (2013)