Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Harry
    Last name: Buhrman
    DBLP: b/HarryBuhrman
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 25 of 170  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner.
    Position-Based Quantum Cryptography: Impossibility and Constructions.
    SIAM J. Comput. 2014, Volume 43 (0) 2014
    Conference paper
    Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman.
    Computing with a full memory: Catalytic space.
    Electronic Colloquium on Computational Complexity (ECCC) 2014, Volume 21 (0) 2014
    Conference paper
    Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman.
    Computing with a full memory: catalytic space.
    Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014 2014 (0) 2014
    Conference paper
    Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff.
    Reductions to the set of random strings: The resource-bounded case.
    Logical Methods in Computer Science 2014, Volume 10 (0) 2014
    Conference paper
    Harry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman.
    The garden-hose model.
    Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013 2013 (0) 2013
    Journal article
    Jop Briët, Harry Buhrman, Troy Lee, Thomas Vidick.
    Multipartite entanglement in XOR games.
    Quantum Information Computation 2013, Volume 13 (0) 2013
    Conference paper
    Harry Buhrman, Lance Fortnow, John M. Hitchcock, Bruno Loff.
    Learning Reductions to Sparse Sets.
    Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings 2013 (0) 2013
    Journal article
    Harry Buhrman, David García-Soriano, Arie Matsliah, Ronald de Wolf.
    The non-adaptive query complexity of testing k-parities.
    Chicago J. Theor. Comput. Sci. 2013, Volume 2013 (0) 2013
    Conference paper
    Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolai K. Vereshchagin.
    Towards a Reverse Newman's Theorem in Interactive Information Complexity.
    Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013 2013 (0) 2013
    Conference paper
    Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff.
    Reductions to the Set of Random Strings: The Resource-Bounded Case.
    Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings 2012 (0) 2012
    Journal article
    Harry Buhrman, David García-Soriano, Arie Matsliah, Ronald de Wolf.
    The non-adaptive query complexity of testing k-parities
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Harry Buhrman, Matthias Christandl, Christian Schaffner.
    Complete Insecurity of Quantum Protocols for Classical Two-Party Computation
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Jop Briët, Harry Buhrman, Dion Gijswijt.
    Violating the Shannon capacity of metric graphs with entanglement
    CoRR 2012, Volume 0 (0) 2012
    Journal article
    Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf.
    Near-Optimal and Explicit Bell Inequality Violations.
    Theory of Computing 2012, Volume 8 (0) 2012
    Conference paper
    Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff.
    Reductions to the set of random strings: the resource-bounded case.
    Electronic Colloquium on Computational Complexity (ECCC) 2012, Volume 19 (0) 2012
    Conference paper
    Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman.
    Towards a Reverse Newman's Theorem in Interactive Information Complexity.
    Electronic Colloquium on Computational Complexity (ECCC) 2012, Volume 19 (0) 2012
    Journal article
    Harry Buhrman, Serge Fehr, Christian Schaffner.
    Position-Based Quantum Cryptography.
    ERCIM News 2011, Volume 2011 (0) 2011
    Conference paper
    Harry Buhrman, Peter T. S. van der Gulik, Steven Kelk, Wouter M. Koolen, Leen Stougie.
    Some Mathematical Refinements Concerning Error Minimization in the Genetic Code.
    IEEE/ACM Trans. Comput. Biology Bioinform. 2011, Volume 8 (0) 2011
    Conference paper
    Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf.
    Near-Optimal and Explicit Bell Inequality Violations.
    Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, June 8-10, 2011 2011 (0) 2011
    Conference paper
    Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner.
    Position-Based Quantum Cryptography: Impossibility and Constructions.
    Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Harry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman.
    The Garden-Hose Game: A New Model of Computation, and Application to Position-Based Quantum Cryptography
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Harry Buhrman, Benjamin J. Hescott, Steven Homer, Leen Torenvliet.
    Non-Uniform Reductions.
    Theory Comput. Syst. 2010, Volume 47 (0) 2010
    Conference paper
    Harry Buhrman, Lance Fortnow, Michal Koucký, Bruno Loff.
    Derandomizing from Random Strings.
    Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, June 9-12, 2010 2010 (0) 2010
    Journal article
    Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner.
    Position-Based Quantum Cryptography: Impossibility and Constructions
    CoRR 2010, Volume 0 (0) 2010
    Journal article
    Harry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin.
    Sparse Selfreducible Sets and Nonuniform Lower Bounds.
    Electronic Colloquium on Computational Complexity (ECCC) 2010, Volume 17 (0) 2010
    Show item 1 to 25 of 170  

    Your query returned 170 matches in the database.