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 100 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
    Journal article
    Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff.
    Reductions to the set of random strings: The resource-bounded case.
    CoRR 2014, Volume 0 (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
    Journal article
    Scott Aaronson, Harry Buhrman, John M. Hitchcock, Dieter van Melkebeek.
    A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games.
    Electronic Colloquium on Computational Complexity (ECCC) 2010, Volume 17 (0) 2010
    Journal article
    Harry Buhrman, David García-Soriano, Arie Matsliah.
    Learning parities in the mistake-bound model.
    Inf. Process. Lett. 2010, Volume 111 (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.
    IACR Cryptology ePrint Archive 2010, Volume 2010 (0) 2010
    Journal article
    Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin.
    Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
    Theory Comput. Syst. 2010, Volume 46 (0) 2010
    Journal article
    Harry Buhrman, Lance Fortnow, Rahul Santhanam.
    Unconditional Lower Bounds against Advice.
    Electronic Colloquium on Computational Complexity (ECCC) 2009, Volume 16 (0) 2009
    Journal article
    Harry Buhrman, David García-Soriano, Arie Matsliah.
    Learning parities in the mistake-bound model.
    Electronic Colloquium on Computational Complexity (ECCC) 2009, Volume 16 (0) 2009
    Conference paper
    Harry Buhrman, Lance Fortnow, Rahul Santhanam.
    Unconditional Lower Bounds against Advice.
    Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I 2009 (0) 2009
    Conference paper
    Harry Buhrman, Lance Fortnow, Michal Koucký, Bruno Loff.
    Derandomizing from Random Strings
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Harry Buhrman, Michal Koucký, Nikolai K. Vereshchagin.
    Randomised Individual Communication Complexity.
    Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA 2008 (0) 2008
    Conference paper
    Harry Buhrman, John M. Hitchcock.
    NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly.
    Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA 2008 (0) 2008
    Conference paper
    Harry Buhrman, John M. Hitchcock.
    NP-Hard Sets are Exponentially Dense Unless NP is contained in coNP/poly.
    Electronic Colloquium on Computational Complexity (ECCC) 2008, Volume 15 (0) 2008
    Conference paper
    Harry Buhrman.
    Foreword.
    J. Comput. Syst. Sci. 2008, Volume 74 (0) 2008
    Conference paper
    Harry Buhrman, Lance Fortnow, Ilan Newman, Hein Röhrig.
    Quantum Property Testing.
    SIAM J. Comput. 2007, Volume 37 (0) 2008
    Conference paper
    Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin.
    High Entropy Random Selection Protocols.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Harry Buhrman, Nikolai K. Vereshchagin, Ronald de Wolf.
    On Computation and Communication with Small Bias.
    22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA 2007 (0) 2007
    Conference paper
    Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin.
    Inverting Onto Functions and Polynomial Hierarchy.
    Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf.
    07411 Executive Summary -- Algebraic Methods in Computational Complexity.
    Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007 2008 (0) 2007
    Conference paper
    Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf.
    07411 Abstracts Collection -- Algebraic Methods in Computational Complexity.
    Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007 2008 (0) 2007
    Conference paper
    Nikolai K. Vereshchagin, Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir.
    High Entropy Random Selection Protocols.
    Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007 2008 (0) 2007
    Conference paper
    Harry Buhrman.
    On Computation and Communication with Small Bias.
    Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi.
    Individual communication complexity.
    J. Comput. Syst. Sci. 2007, Volume 73 (0) 2007
    Conference paper
    Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf.
    Robust Polynomials and Quantum Algorithms.
    Theory Comput. Syst. 2007, Volume 40 (0) 2007
    Journal article
    Bram Vermeer, Harry Buhrman.
    Quantum Information Processing.
    ERCIM News 2007, Volume 2007 (0) 2007
    Conference paper
    Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger.
    New Limits on Fault-Tolerant Quantum Computation.
    47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings 2006 (0) 2006
    Conference paper
    Harry Buhrman, Robert Spalek.
    Quantum verification of matrix products.
    Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006 2006 (0) 2006
    Conference paper
    Harry Buhrman, Leen Torenvliet, Falk Unger.
    Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds.
    STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Eric Allender, Harry Buhrman, Michal Koucký.
    What can be efficiently reduced to the Kolmogorov-random strings?
    Ann. Pure Appl. Logic 2006, Volume 138 (0) 2006
    Conference paper
    Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi.
    On the importance of having an identity or, is consensus really universal?.
    Distributed Computing 2006, Volume 18 (0) 2006
    Conference paper
    Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin.
    Inverting onto functions might not be hard.
    Electronic Colloquium on Computational Complexity (ECCC) 2006, Volume null (0) 2006
    Conference paper
    Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger.
    Power from Random Strings.
    SIAM J. Comput. 2006, Volume 35 (0) 2006
    Journal article
    Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, Leen Torenvliet.
    Enumerations of the Kolmogorov function.
    J. Symb. Log. 2006, Volume 71 (0) 2006
    Conference paper
    Harry Buhrman.
    Quantum Computing.
    New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings 2005 (0) 2005
    Conference paper
    Harry Buhrman, Lance Fortnow, Ilan Newman, Nikolai K. Vereshchagin.
    Increasing Kolmogorov Complexity.
    STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings 2005 (0) 2005
    Conference paper
    Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf.
    Robust Polynomials and Quantum Algorithms.
    STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings 2005 (0) 2005
    Conference paper
    Harry Buhrman, Troy Lee, Dieter van Melkebeek.
    Language compression and pseudorandom generators.
    Computational Complexity 2005, Volume 14 (0) 2005
    Conference paper
    Harry Buhrman, Leen Torenvliet.
    A Post's Program for Complexity Theory.
    Bulletin of the EATCS 2005, Volume 85 (0) 2005
    Conference paper
    Harry Buhrman, Lance Fortnow, Aduri Pavan.
    Some Results on Derandomization.
    Theory Comput. Syst. 2005, Volume 38 (0) 2005
    Conference paper
    Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf.
    Quantum Algorithms for Element Distinctness.
    SIAM J. Comput. 2004, Volume 34 (0) 2005
    Conference paper
    Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, Hein Röhrig.
    Multiparty Quantum Coin Flipping.
    19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA 2004 (0) 2004
    Conference paper
    Harry Buhrman, Troy Lee, Dieter van Melkebeek.
    Language Compression and Pseudorandom Generators.
    19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA 2004 (0) 2004
    Conference paper
    Harry Buhrman, Leen Torenvliet.
    Separating Complexity Classes Using Structural Properties.
    19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA 2004 (0) 2004
    Conference paper
    Harry Buhrman, Lance Fortnow, Thomas Thierauf.
    04421 Abstracts Collection - Algebraic Methods in Computational Complexity.
    Algebraic Methods in Computational Complexity, 10.-15. October 2004 2005 (0) 2004
    Conference paper
    Eric Allender, Harry Buhrman, Michal Koucký.
    What Can be Efficiently Reduced to the K-Random Strings?
    STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi.
    Individual Communication Complexity: Extended Abstract.
    STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Troy Lee, Dieter van Melkebeek, Harry Buhrman.
    Language Compression and Pseudorandom Generators
    Electronic Colloquium on Computational Complexity (ECCC) 2004, Volume null (0) 2004
    Conference paper
    Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, Leen Torenvliet.
    Enumerations of the Kolmogorov Function
    Electronic Colloquium on Computational Complexity (ECCC) 2004, Volume null (0) 2004
    Conference paper
    Eric Allender, Harry Buhrman, Michal Koucký.
    What Can be Efficiently Reduced to the Kolmogorov-Random Strings?
    Electronic Colloquium on Computational Complexity (ECCC) 2004, Volume null (0) 2004
    Conference paper
    Harry Buhrman, Lance Fortnow, Ilan Newman, Nikolai K. Vereshchagin.
    Increasing Kolmogorov Complexity
    Electronic Colloquium on Computational Complexity (ECCC) 2004, Volume null (0) 2004
    Conference paper
    Harry Buhrman, Hein Röhrig.
    Distributed Quantum Computing.
    Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings 2003 (0) 2003
    Conference paper
    Harry Buhrman, Lance Fortnow, Ilan Newman, Hein Röhrig.
    Quantum property testing.
    SODA 2003 (0) 2003
    Conference paper
    Harry Buhrman, Richard Chang, Lance Fortnow.
    One Bit of Advice.
    STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings 2003 (0) 2003
    Conference paper
    Harry Buhrman, Lance Fortnow, Aduri Pavan.
    Some Results on Derandomization.
    STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings 2003 (0) 2003
    Conference paper
    Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi.
    Individual Communication Complexity
    CoRR 2003, Volume 0 (0) 2003
    Conference paper
    Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, Hein Röhrig.
    Multiparty Quantum Coin Flipping
    CoRR 2003, Volume 0 (0) 2003
    Conference paper
    Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf.
    Robust Quantum Algorithms and Polynomials
    CoRR 2003, Volume 0 (0) 2003
    Conference paper
    Harry Buhrman, Ronald de Wolf.
    Quantum zero-error algorithms cannot be composed.
    Inf. Process. Lett. 2003, Volume 87 (0) 2003
    Conference paper
    Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger.
    Power from Random Strings.
    43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings 2002 (0) 2002
    Conference paper
    Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi.
    On the Importance of Having an Identity or, is Consensus really Universal?
    CoRR 2002, Volume 0 (0) 2002
    Conference paper
    Harry Buhrman, Ronald de Wolf.
    Quantum Zero-Error Algorithms Cannot be Composed
    CoRR 2002, Volume 0 (0) 2002
    Conference paper
    Eric Allender, Harry Buhrman, Michal Koucký, Detlef Ronneburger, Dieter van Melkebeek.
    Power from Random Strings
    Electronic Colloquium on Computational Complexity (ECCC) 2002, Volume null (0) 2002
    Conference paper
    Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh.
    Are Bitvectors Optimal?
    SIAM J. Comput. 2001, Volume 31 (0) 2002
    Conference paper
    Harry Buhrman, Ronald de Wolf.
    Complexity measures and decision tree complexity: a survey.
    Theor. Comput. Sci. 2002, Volume 288 (0) 2002
    Conference paper
    Harry Buhrman.
    Quantum Computing and Communication Complexity.
    Current Trends in Theoretical Computer Science 2001 (0) 2001
    Conference paper
    Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf.
    Quantum Algorithms for Element Distinctness.
    IEEE Conference on Computational Complexity 2001 (0) 2001
    Conference paper
    Harry Buhrman, Ronald de Wolf.
    Communication Complexity Lower Bounds by Polynomials.
    IEEE Conference on Computational Complexity 2001 (0) 2001
    Conference paper
    Harry Buhrman, John Tromp, Paul M. B. Vitányi.
    Time and Space Bounds for Reversible Simulation.
    Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings 2001 (0) 2001
    Conference paper
    Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet.
    Two oracles that force a big crunch.
    Computational Complexity 2001, Volume 10 (0) 2001
    Conference paper
    Harry Buhrman, John Tromp, Paul M. B. Vitányi.
    Time and Space Bounds for Reversible Simulation
    CoRR 2001, Volume 0 (0) 2001
    Conference paper
    Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet.
    The Communication Complexity of Enumeration, Elimination, and Selection
    Electronic Colloquium on Computational Complexity (ECCC) 2001, Volume 8 (0) 2001
    Conference paper
    Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf.
    Quantum lower bounds by polynomials.
    J. ACM 2001, Volume 48 (0) 2001
    Conference paper
    Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet.
    The Communication Complexity of Enumeration, Elimination, and Selection.
    J. Comput. Syst. Sci. 2001, Volume 63 (0) 2001
    Conference paper
    Harry Buhrman, Lance Fortnow, Sophie Laplante.
    Resource-Bounded Kolmogorov Complexity Revisited.
    SIAM J. Comput. 2001, Volume 31 (0) 2001
    Conference paper
    Harry Buhrman, Luc Longpré.
    Compressibility and Resource Bounded Measure.
    SIAM J. Comput. 2001, Volume 31 (0) 2001
    Conference paper
    Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet.
    The Communication Complexity of Enumeration, Elimination, and Selection.
    IEEE Conference on Computational Complexity 2000 (0) 2000
    Conference paper
    Harry Buhrman, Sophie Laplante, Peter Bro Miltersen.
    New Bounds for the Language Compression Problem.
    IEEE Conference on Computational Complexity 2000 (0) 2000
    Show item 1 to 100 of 170  

    Your query returned 170 matches in the database.