Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Harry Buhrman" ( http://dblp.L3S.de/Authors/Harry_Buhrman )

URL (Homepage):  http://homepages.cwi.nl/~buhrman/  Author page on DBLP  Author page in RDF  Community of Harry Buhrman in ASPL-2

Publication years (Num. hits)
1991-1995 (20) 1996-1998 (25) 1999 (16) 2000-2001 (22) 2002-2004 (24) 2005-2006 (16) 2007-2008 (16) 2009-2011 (17) 2012 (1)
Publication types (Num. hits)
article(80) incollection(1) inproceedings(74) proceedings(2)
Venues (Conferences, Journals, ...)
IEEE Conference on Computation...(19) CoRR(18) STACS(16) SIAM J. Comput.(14) Electronic Colloquium on Compu...(13) J. Comput. Syst. Sci.(8) Algebraic Methods in Computati...(6) Structure in Complexity Theory...(6) FOCS(5) ICALP(5) Theory Comput. Syst.(5) Inf. Process. Lett.(4) Computational Complexity(3) SODA(3) STOC(3) Bulletin of the EATCS(2) More (+10 of total 39)
Authors
Harry Buhrman(157) Lance Fortnow(34) Leen Torenvliet(28) Ronald de Wolf(19) Paul M. B. Vitányi(18) Dieter van Melkebeek(14) Michal Koucký(14) Nikolai K. Vereshchagin(13) Thomas Thierauf(9) Hein Röhrig(8) Jaap-Henk Hoepman(8) Richard Cleve(8) Ilan Newman(7) Christian Schaffner(6) Eric Allender(6) John Tromp(6) More (+10 of total 99)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 40 occurrences of 30 keywords
Results
Found 157 publication records. Showing 157 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Harry Buhrman, Matthias Christandl, Christian Schaffner Complete Insecurity of Quantum Protocols for Classical Two-Party Computation Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Harry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman The Garden-Hose Game: A New Model of Computation, and Application to Position-Based Quantum Cryptography Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Harry Buhrman, Peter T. S. van der Gulik, Steven Kelk, Wouter M. Koolen, Leen Stougie Some Mathematical Refinements Concerning Error Minimization in the Genetic Code. Search on Bibsonomy IEEE/ACM Trans. Comput. Biology Bioinform. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Serge Fehr, Christian Schaffner Position-Based Quantum Cryptography. Search on Bibsonomy ERCIM News The full citation details ... 2011 DBLP  BibTeX  RDF
1Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner Position-Based Quantum Cryptography: Impossibility and Constructions. Search on Bibsonomy CRYPTO The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf Near-Optimal and Explicit Bell Inequality Violations. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, David García-Soriano, Arie Matsliah Learning parities in the mistake-bound model. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin Sparse Selfreducible Sets and Nonuniform Lower Bounds. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, John M. Hitchcock, Dieter van Melkebeek A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner Position-Based Quantum Cryptography: Impossibility and Constructions. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2010 DBLP  BibTeX  RDF
1Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner Position-Based Quantum Cryptography: Impossibility and Constructions Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Harry Buhrman, Benjamin J. Hescott, Steven Homer, Leen Torenvliet Non-Uniform Reductions. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible? Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Michal Koucký, Bruno Loff Derandomizing from Random Strings. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Truth-table Reducibility, Kolmogorov Complexity, Derandomization
1Harry Buhrman, Lance Fortnow, Rahul Santhanam Unconditional Lower Bounds against Advice. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Harry Buhrman, David García-Soriano, Arie Matsliah Learning parities in the mistake-bound model. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Michal Koucký, Bruno Loff Derandomizing from Random Strings Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Rahul Santhanam Unconditional Lower Bounds against Advice. Search on Bibsonomy ICALP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, John M. Hitchcock NP-Hard Sets are Exponentially Dense Unless NP is contained in coNP/poly. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2008 DBLP  BibTeX  RDF
1Harry Buhrman Foreword. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Ilan Newman, Hein Röhrig Quantum Property Testing. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf (eds.) Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007 Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2008 DBLP  BibTeX  RDF
1Harry Buhrman, Michal Koucký, Nikolai K. Vereshchagin Randomised Individual Communication Complexity. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF individual communication complexity, Kolmogorov complexity, rounds, randomized protocols
1Harry Buhrman, John M. Hitchcock NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF hard sets, polynomial advice, instance complexity
1Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf Robust Polynomials and Quantum Algorithms. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Bram Vermeer, Harry Buhrman Quantum Information Processing. Search on Bibsonomy ERCIM News The full citation details ... 2007 DBLP  BibTeX  RDF
1Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi Individual communication complexity. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin Inverting Onto Functions and Polynomial Hierarchy. Search on Bibsonomy CSR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf 07411 Abstracts Collection -- Algebraic Methods in Computational Complexity. Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2007 DBLP  BibTeX  RDF
1Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf 07411 Executive Summary -- Algebraic Methods in Computational Complexity. Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2007 DBLP  BibTeX  RDF
1Nikolai K. Vereshchagin, Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir High Entropy Random Selection Protocols. Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2007 DBLP  BibTeX  RDF
1Harry Buhrman On Computation and Communication with Small Bias. Search on Bibsonomy SAGA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin High Entropy Random Selection Protocols. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Nikolai K. Vereshchagin, Ronald de Wolf On Computation and Communication with Small Bias. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin Inverting onto functions might not be hard. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, Leen Torenvliet Enumerations of the Kolmogorov function. Search on Bibsonomy J. Symb. Log. The full citation details ... 2006 DBLP  BibTeX  RDF
1Eric Allender, Harry Buhrman, Michal Koucký What can be efficiently reduced to the Kolmogorov-random strings? Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi On the importance of having an identity or, is consensus really universal?. Search on Bibsonomy Distributed Computing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger Power from Random Strings. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Robert Spalek Quantum verification of matrix products. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Leen Torenvliet, Falk Unger Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. Search on Bibsonomy STACS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Selfreducibility, Computational Complexity, Sparseness
1Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger New Limits on Fault-Tolerant Quantum Computation. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Troy Lee, Dieter van Melkebeek Language compression and pseudorandom generators. Search on Bibsonomy Computational Complexity The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Subject classification, 68P30
1Harry Buhrman, Leen Torenvliet A Post's Program for Complexity Theory. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2005 DBLP  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Aduri Pavan Some Results on Derandomization. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf Quantum Algorithms for Element Distinctness. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Ilan Newman, Nikolai K. Vereshchagin Increasing Kolmogorov Complexity. Search on Bibsonomy STACS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf Robust Polynomials and Quantum Algorithms. Search on Bibsonomy STACS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Thomas Thierauf (eds.) Algebraic Methods in Computational Complexity, 10.-15. October 2004 Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2005 DBLP  BibTeX  RDF
1Harry Buhrman Quantum Computing. Search on Bibsonomy CiE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Ilan Newman, Nikolai K. Vereshchagin Increasing Kolmogorov Complexity Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Troy Lee, Dieter van Melkebeek, Harry Buhrman Language Compression and Pseudorandom Generators Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrei A. Muchnik, Frank Stephan, Leen Torenvliet Enumerations of the Kolmogorov Function Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Eric Allender, Harry Buhrman, Michal Koucký What Can be Efficiently Reduced to the Kolmogorov-Random Strings? Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi Individual Communication Complexity: Extended Abstract. Search on Bibsonomy STACS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Eric Allender, Harry Buhrman, Michal Koucký What Can be Efficiently Reduced to the K-Random Strings? Search on Bibsonomy STACS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Thomas Thierauf 04421 Abstracts Collection - Algebraic Methods in Computational Complexity. Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2004 DBLP  BibTeX  RDF
1Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, Hein Röhrig Multiparty Quantum Coin Flipping. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Troy Lee, Dieter van Melkebeek Language Compression and Pseudorandom Generators. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Leen Torenvliet Separating Complexity Classes Using Structural Properties. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Ronald de Wolf Quantum zero-error algorithms cannot be composed. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, Hein Röhrig Multiparty Quantum Coin Flipping Search on Bibsonomy CoRR The full citation details ... 2003 DBLP  BibTeX  RDF
1Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf Robust Quantum Algorithms and Polynomials Search on Bibsonomy CoRR The full citation details ... 2003 DBLP  BibTeX  RDF
1Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi Individual Communication Complexity Search on Bibsonomy CoRR The full citation details ... 2003 DBLP  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Ilan Newman, Hein Röhrig Quantum property testing. Search on Bibsonomy SODA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Hein Röhrig Distributed Quantum Computing. Search on Bibsonomy MFCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Richard Chang, Lance Fortnow One Bit of Advice. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Aduri Pavan Some Results on Derandomization. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Eric Allender, Harry Buhrman, Michal Koucký, Detlef Ronneburger, Dieter van Melkebeek Power from Random Strings Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2002 DBLP  BibTeX  RDF
1Harry Buhrman, Ronald de Wolf Complexity measures and decision tree complexity: a survey. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Ronald de Wolf Quantum Zero-Error Algorithms Cannot be Composed Search on Bibsonomy CoRR The full citation details ... 2002 DBLP  BibTeX  RDF
1Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi On the Importance of Having an Identity or, is Consensus really Universal? Search on Bibsonomy CoRR The full citation details ... 2002 DBLP  BibTeX  RDF
1Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh Are Bitvectors Optimal? Search on Bibsonomy SIAM J. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger Power from Random Strings. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet The Communication Complexity of Enumeration, Elimination, and Selection Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2001 DBLP  BibTeX  RDF
1Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf Quantum lower bounds by polynomials. Search on Bibsonomy J. ACM The full citation details ... 2001 DBLP  DOI  BibTeX  RDF polynomial method, lower bounds, Quantum computing, query complexity, black-box model
1Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet Two oracles that force a big crunch. Search on Bibsonomy Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, John Tromp, Paul M. B. Vitányi Time and Space Bounds for Reversible Simulation Search on Bibsonomy CoRR The full citation details ... 2001 DBLP  BibTeX  RDF
1Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet The Communication Complexity of Enumeration, Elimination, and Selection. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Luc Longpré Compressibility and Resource Bounded Measure. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Sophie Laplante Resource-Bounded Kolmogorov Complexity Revisited. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Harry Buhrman Quantum Computing and Communication Complexity. Search on Bibsonomy Current Trends in Theoretical Computer Science The full citation details ... 2001 DBLP  BibTeX  RDF
1Harry Buhrman, John Tromp, Paul M. B. Vitányi Time and Space Bounds for Reversible Simulation. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Ronald de Wolf Communication Complexity Lower Bounds by Polynomials. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf Quantum Algorithms for Element Distinctness. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi New applications of the incompressibility method: Part II. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Harry Buhrman Quantum Computing and Communication Complexity. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2000 DBLP  BibTeX  RDF
1Harry Buhrman, Leen Torenvliet Randomness is Hard. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet Separating Complexity Classes Using Autoreducibility. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Richard Cleve, Wim van Dam Quantum Entanglement and Communication Complexity. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek Optimal Proof Systems and Sparse Sets. Search on Bibsonomy STACS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi On the Importance of Having an Identity or is Consensus Really Universal? Search on Bibsonomy DISC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Sophie Laplante, Peter Bro Miltersen New Bounds for the Language Compression Problem. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet The Communication Complexity of Enumeration, Elimination, and Selection. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh Are bitvectors optimal? Search on Bibsonomy STOC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Ronald de Wolf A Lower Bound for Quantum Search of an Ordered List. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi Mutual Search. Search on Bibsonomy J. ACM The full citation details ... 1999 DBLP  DOI  BibTeX  RDF coalition forming, datastructures, mutual search, computational complexity, distributed computation, computer networks, discrete algorithms
1Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka Bounds for Small-Error and Zero-Error Quantum Algorithms Search on Bibsonomy CoRR The full citation details ... 1999 DBLP  BibTeX  RDF
1Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi Mutual Search Search on Bibsonomy CoRR The full citation details ... 1999 DBLP  BibTeX  RDF
Displaying result #1 - #100 of 157 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.