Harry Buhrman
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
44
Venues
10
Active years
1991–2021
Best venue rank
A*
Where they publish
Papers
44 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2021 | STACS | A Framework of Quantum Strong Exponential-Time Hypotheses. | Harry Buhrman, Subhasree Patro, Florian Speelman |
| 2019 | STACS | Bounding Quantum-Classical Separations for Classes of Nonlocal Games. | Tom Bannink, Jop Brit, Harry Buhrman, Farrokh Labib, Troy Lee |
| 2016 | STACS | Catalytic Space: Non-determinism and Hierarchy. | Harry Buhrman, Michal Kouck, Bruno Loff, Florian Speelman |
| 2014 | STOC | Computing with a full memory: catalytic space. | Harry Buhrman, Richard Cleve, Michal Kouck, Bruno Loff, Florian Speelman |
| 2013 | MFCS | Learning Reductions to Sparse Sets. | Harry Buhrman, Lance Fortnow, John M. Hitchcock, Bruno Loff |
| 2012 | MFCS | Reductions to the Set of Random Strings: The Resource-Bounded Case. | Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff |
| 2011 | CRYPTO | Position-Based Quantum Cryptography: Impossibility and Constructions. | Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner |
| 2009 | ICALP | Unconditional Lower Bounds against Advice. | Harry Buhrman, Lance Fortnow, Rahul Santhanam |
| 2007 | CSR | Inverting Onto Functions and Polynomial Hierarchy. | Harry Buhrman, Lance Fortnow, Michal Kouck, John D. Rogers, Nikolai K. Vereshchagin |
| 2006 | FOCS | New Limits on Fault-Tolerant Quantum Computation. | Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger |
| 2006 | SODA | Quantum verification of matrix products. | Harry Buhrman, Robert Spalek |
| 2006 | STACS | Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. | Harry Buhrman, Leen Torenvliet, Falk Unger |
| 2005 | CiE | Quantum Computing. | Harry Buhrman |
| 2005 | STACS | Increasing Kolmogorov Complexity. | Harry Buhrman, Lance Fortnow, Ilan Newman, Nikolai K. Vereshchagin |
| 2005 | STACS | Robust Polynomials and Quantum Algorithms. | Harry Buhrman, Ilan Newman, Hein Rhrig, Ronald de Wolf |
| 2004 | STACS | What Can be Efficiently Reduced to the K-Random Strings? | Eric Allender, Harry Buhrman, Michal Kouck |
| 2004 | STACS | Individual Communication Complexity: Extended Abstract. | Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitnyi |
| 2003 | MFCS | Distributed Quantum Computing. | Harry Buhrman, Hein Rhrig |
| 2003 | SODA | Quantum property testing. | Harry Buhrman, Lance Fortnow, Ilan Newman, Hein Rhrig |
| 2003 | STACS | One Bit of Advice. | Harry Buhrman, Richard Chang, Lance Fortnow |
| 2003 | STACS | Some Results on Derandomization. | Harry Buhrman, Lance Fortnow, Aduri Pavan |
| 2002 | FOCS | Power from Random Strings. | Eric Allender, Harry Buhrman, Michal Kouck, Dieter van Melkebeek, Detlef Ronneburger |
| 2001 | ICALP | Time and Space Bounds for Reversible Simulation. | Harry Buhrman, John Tromp, Paul M. B. Vitnyi |
| 2000 | STOC | Are bitvectors optimal? | Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh |
| 2000 | STACS | Optimal Proof Systems and Sparse Sets. | Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek |
| 1999 | FOCS | Bounds for Small-Error and Zero-Error Quantum Algorithms. | Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka |
| 1999 | ICALP | New Applications of the Incompressibility Method. | Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitnyi |
| 1999 | STACS | One-sided Versus Two-sided Error in Probabilistic Computation. | Harry Buhrman, Lance Fortnow |
| 1998 | FOCS | Quantum Lower Bounds by Polynomials. | Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf |
| 1998 | SODA | Mutual Search (Extended Abstract). | Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitnyi |
| 1998 | STOC | NP Might Not Be As Easy As Detecting Unique Solutions. | Richard Beigel, Harry Buhrman, Lance Fortnow |
| 1998 | STOC | Quantum vs. Classical Communication and Computation. | Harry Buhrman, Richard Cleve, Avi Wigderson |
| 1998 | STACS | A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract). | Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss |
| 1997 | ICALP | Results on Resource-Bounded Measure. | Harry Buhrman, Stephen A. Fenner, Lance Fortnow |
| 1997 | STACS | Resource-Bounded Kolmogorov Complexity Revisited. | Harry Buhrman, Lance Fortnow |
| 1996 | PODC | Optimal Routing Tables. | Harry Buhrman, Jaap-Henk Hoepman, Paul M. B. Vitnyi |
| 1996 | STACS | Compressibility and Resource Bounded Measure. | Harry Buhrman, Luc Longpr |
| 1996 | STACS | The Complexity of Generating and Checking Proffs of Membership. | Harry Buhrman, Thomas Thierauf |
| 1995 | FOCS | Using Autoreducibility to Separate Complexity Classes. | Harry Buhrman, Lance Fortnow, Leen Torenvliet |
| 1995 | PODC | Long-Lived Renaming Made Fast. | Harry Buhrman, Juan A. Garay, Jaap-Henk Hoepman, Mark Moir |
| 1995 | STACS | On the Sparse Set Conjecture for Sets with Low Denisty. | Harry Buhrman, Montserrat Hermo |
| 1994 | ICALP | On the Cutting Edge of Relativization: The Resource Bounded Injury Method. | Harry Buhrman, Leen Torenvliet |
| 1993 | STACS | Splittings, Robustness and Structure of Complete Sets. | Harry Buhrman, Albrecht Hoene, Leen Torenvliet |
| 1991 | STACS | Bounded Reductions. | Harry Buhrman, Edith Spaan, Leen Torenvliet |