| 2008 |
|---|
| 136 | | Manindra Agrawal,
Harry Buhrman,
Lance Fortnow,
Thomas Thierauf:
Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
| 135 | EE | Harry Buhrman,
John M. Hitchcock:
NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly.
IEEE Conference on Computational Complexity 2008: 1-7 |
| 134 | EE | Harry Buhrman,
Michal Koucký,
Nikolai K. Vereshchagin:
Randomised Individual Communication Complexity.
IEEE Conference on Computational Complexity 2008: 321-331 |
| 133 | EE | Harry Buhrman,
John M. Hitchcock:
NP-Hard Sets are Exponentially Dense Unless NP is contained in coNP/poly.
Electronic Colloquium on Computational Complexity (ECCC) 15(022): (2008) |
| 132 | EE | Harry Buhrman:
Foreword.
J. Comput. Syst. Sci. 74(3): 297 (2008) |
| 131 | EE | Harry Buhrman,
Lance Fortnow,
Ilan Newman,
Hein Röhrig:
Quantum Property Testing.
SIAM J. Comput. 37(5): 1387-1400 (2008) |
| 2007 |
|---|
| 130 | EE | Harry Buhrman,
Matthias Christandl,
Michal Koucký,
Zvi Lotker,
Boaz Patt-Shamir,
Nikolai K. Vereshchagin:
High Entropy Random Selection Protocols.
APPROX-RANDOM 2007: 366-379 |
| 129 | EE | Manindra Agrawal,
Harry Buhrman,
Lance Fortnow,
Thomas Thierauf:
07411 Abstracts Collection -- Algebraic Methods in Computational Complexity.
Algebraic Methods in Computational Complexity 2007 |
| 128 | EE | Manindra Agrawal,
Harry Buhrman,
Lance Fortnow,
Thomas Thierauf:
07411 Executive Summary -- Algebraic Methods in Computational Complexity.
Algebraic Methods in Computational Complexity 2007 |
| 127 | EE | Nikolai K. Vereshchagin,
Harry Buhrman,
Matthias Christandl,
Michal Koucký,
Zvi Lotker,
Boaz Patt-Shamir:
High Entropy Random Selection Protocols.
Algebraic Methods in Computational Complexity 2007 |
| 126 | EE | Harry Buhrman,
Lance Fortnow,
Michal Koucký,
John D. Rogers,
Nikolai K. Vereshchagin:
Inverting Onto Functions and Polynomial Hierarchy.
CSR 2007: 92-103 |
| 125 | EE | Harry Buhrman,
Nikolai K. Vereshchagin,
Ronald de Wolf:
On Computation and Communication with Small Bias.
IEEE Conference on Computational Complexity 2007: 24-32 |
| 124 | EE | Harry Buhrman:
On Computation and Communication with Small Bias.
SAGA 2007: 1 |
| 123 | EE | Harry Buhrman,
Hartmut Klauck,
Nikolai K. Vereshchagin,
Paul M. B. Vitányi:
Individual communication complexity.
J. Comput. Syst. Sci. 73(6): 973-985 (2007) |
| 122 | EE | Harry Buhrman,
Ilan Newman,
Hein Röhrig,
Ronald de Wolf:
Robust Polynomials and Quantum Algorithms.
Theory Comput. Syst. 40(4): 379-395 (2007) |
| 2006 |
|---|
| 121 | EE | Harry Buhrman,
Richard Cleve,
Monique Laurent,
Noah Linden,
Alexander Schrijver,
Falk Unger:
New Limits on Fault-Tolerant Quantum Computation.
FOCS 2006: 411-419 |
| 120 | EE | Harry Buhrman,
Robert Spalek:
Quantum verification of matrix products.
SODA 2006: 880-889 |
| 119 | EE | Harry Buhrman,
Leen Torenvliet,
Falk Unger:
Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds.
STACS 2006: 455-468 |
| 118 | EE | Eric Allender,
Harry Buhrman,
Michal Koucký:
What can be efficiently reduced to the Kolmogorov-random strings?
Ann. Pure Appl. Logic 138(1-3): 2-19 (2006) |
| 117 | EE | 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 18(3): 167-176 (2006) |
| 116 | EE | 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) 13(024): (2006) |
| 115 | EE | Eric Allender,
Harry Buhrman,
Michal Koucký,
Dieter van Melkebeek,
Detlef Ronneburger:
Power from Random Strings.
SIAM J. Comput. 35(6): 1467-1493 (2006) |
| 2005 |
|---|
| 114 | | Harry Buhrman,
Lance Fortnow,
Thomas Thierauf:
Algebraic Methods in Computational Complexity, 10.-15. October 2004
IBFI, Schloss Dagstuhl, Germany 2005 |
| 113 | EE | Harry Buhrman:
Quantum Computing.
CiE 2005: 68-68 |
| 112 | EE | Harry Buhrman,
Lance Fortnow,
Ilan Newman,
Nikolai K. Vereshchagin:
Increasing Kolmogorov Complexity.
STACS 2005: 412-421 |
| 111 | EE | Harry Buhrman,
Ilan Newman,
Hein Röhrig,
Ronald de Wolf:
Robust Polynomials and Quantum Algorithms.
STACS 2005: 593-604 |
| 110 | | Harry Buhrman,
Leen Torenvliet:
A Post's Program for Complexity Theory.
Bulletin of the EATCS 85: 41-51 (2005) |
| 109 | EE | Harry Buhrman,
Troy Lee,
Dieter van Melkebeek:
Language compression and pseudorandom generators.
Computational Complexity 14(3): 228-255 (2005) |
| 108 | EE | 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. 34(6): 1324-1330 (2005) |
| 107 | EE | Harry Buhrman,
Lance Fortnow,
Aduri Pavan:
Some Results on Derandomization.
Theory Comput. Syst. 38(2): 211-227 (2005) |
| 2004 |
|---|
| 106 | EE | Harry Buhrman,
Lance Fortnow,
Thomas Thierauf:
04421 Abstracts Collection - Algebraic Methods in Computational Complexity.
Algebraic Methods in Computational Complexity 2004 |
| 105 | EE | Harry Buhrman,
Leen Torenvliet:
Separating Complexity Classes Using Structural Properties.
IEEE Conference on Computational Complexity 2004: 130-138 |
| 104 | EE | Harry Buhrman,
Troy Lee,
Dieter van Melkebeek:
Language Compression and Pseudorandom Generators.
IEEE Conference on Computational Complexity 2004: 15-28 |
| 103 | EE | Andris Ambainis,
Harry Buhrman,
Yevgeniy Dodis,
Hein Röhrig:
Multiparty Quantum Coin Flipping.
IEEE Conference on Computational Complexity 2004: 250-259 |
| 102 | EE | Harry Buhrman,
Hartmut Klauck,
Nikolai K. Vereshchagin,
Paul M. B. Vitányi:
Individual Communication Complexity: Extended Abstract.
STACS 2004: 19-30 |
| 101 | EE | Eric Allender,
Harry Buhrman,
Michal Koucký:
What Can be Efficiently Reduced to the K-Random Strings?
STACS 2004: 584-595 |
| 100 | EE | Troy Lee,
Dieter van Melkebeek,
Harry Buhrman:
Language Compression and Pseudorandom Generators
Electronic Colloquium on Computational Complexity (ECCC)(002): (2004) |
| 99 | EE | Richard Beigel,
Harry Buhrman,
Peter A. Fejer,
Lance Fortnow,
Piotr Grabowski,
Luc Longpré,
Andrei A. Muchnik,
Frank Stephan,
Leen Torenvliet:
Enumerations of the Kolmogorov Function
Electronic Colloquium on Computational Complexity (ECCC)(015): (2004) |
| 98 | EE | Eric Allender,
Harry Buhrman,
Michal Koucký:
What Can be Efficiently Reduced to the Kolmogorov-Random Strings?
Electronic Colloquium on Computational Complexity (ECCC)(044): (2004) |
| 97 | EE | Harry Buhrman,
Lance Fortnow,
Ilan Newman,
Nikolai K. Vereshchagin:
Increasing Kolmogorov Complexity
Electronic Colloquium on Computational Complexity (ECCC)(081): (2004) |
| 2003 |
|---|
| 96 | EE | Harry Buhrman,
Hein Röhrig:
Distributed Quantum Computing.
MFCS 2003: 1-20 |
| 95 | EE | Harry Buhrman,
Lance Fortnow,
Ilan Newman,
Hein Röhrig:
Quantum property testing.
SODA 2003: 480-488 |
| 94 | EE | Harry Buhrman,
Lance Fortnow,
Aduri Pavan:
Some Results on Derandomization.
STACS 2003: 212-222 |
| 93 | EE | Harry Buhrman,
Richard Chang,
Lance Fortnow:
One Bit of Advice.
STACS 2003: 547-558 |
| 92 | EE | Harry Buhrman,
Hartmut Klauck,
Nikolai K. Vereshchagin,
Paul M. B. Vitányi:
Individual Communication Complexity
CoRR cs.CC/0304012: (2003) |
| 91 | EE | Andris Ambainis,
Harry Buhrman,
Yevgeniy Dodis,
Hein Röhrig:
Multiparty Quantum Coin Flipping
CoRR quant-ph/0304112: (2003) |
| 90 | EE | Harry Buhrman,
Ilan Newman,
Hein Röhrig,
Ronald de Wolf:
Robust Quantum Algorithms and Polynomials
CoRR quant-ph/0309220: (2003) |
| 89 | EE | Harry Buhrman,
Ronald de Wolf:
Quantum zero-error algorithms cannot be composed.
Inf. Process. Lett. 87(2): 79-84 (2003) |
| 2002 |
|---|
| 88 | EE | Eric Allender,
Harry Buhrman,
Michal Koucký,
Dieter van Melkebeek,
Detlef Ronneburger:
Power from Random Strings.
FOCS 2002: 669-678 |
| 87 | EE | Harry Buhrman,
Alessandro Panconesi,
Riccardo Silvestri,
Paul M. B. Vitányi:
On the Importance of Having an Identity or, is Consensus really Universal?
CoRR cs.DC/0201006: (2002) |
| 86 | EE | Harry Buhrman,
Ronald de Wolf:
Quantum Zero-Error Algorithms Cannot be Composed
CoRR quant-ph/0211029: (2002) |
| 85 | EE | Eric Allender,
Harry Buhrman,
Michal Koucký,
Detlef Ronneburger,
Dieter van Melkebeek:
Power from Random Strings
Electronic Colloquium on Computational Complexity (ECCC)(028): (2002) |
| 84 | EE | Harry Buhrman,
Peter Bro Miltersen,
Jaikumar Radhakrishnan,
Srinivasan Venkatesh:
Are Bitvectors Optimal?
SIAM J. Comput. 31(6): 1723-1744 (2002) |
| 83 | | Harry Buhrman,
Ronald de Wolf:
Complexity measures and decision tree complexity: a survey.
Theor. Comput. Sci. 288(1): 21-43 (2002) |
| 2001 |
|---|
| 82 | EE | Harry Buhrman,
John Tromp,
Paul M. B. Vitányi:
Time and Space Bounds for Reversible Simulation.
ICALP 2001: 1017-1027 |
| 81 | EE | Harry Buhrman,
Ronald de Wolf:
Communication Complexity Lower Bounds by Polynomials.
IEEE Conference on Computational Complexity 2001: 120-130 |
| 80 | EE | 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: 131-137 |
| 79 | | Harry Buhrman:
Quantum Computing and Communication Complexity.
Current Trends in Theoretical Computer Science 2001: 664-679 |
| 78 | EE | Harry Buhrman,
John Tromp,
Paul M. B. Vitányi:
Time and Space Bounds for Reversible Simulation
CoRR quant-ph/0101133: (2001) |
| 77 | EE | Harry Buhrman,
Stephen A. Fenner,
Lance Fortnow,
Leen Torenvliet:
Two oracles that force a big crunch.
Computational Complexity 10(2): 93-116 (2001) |
| 76 | EE | 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) 8(19): (2001) |
| 75 | EE | Robert Beals,
Harry Buhrman,
Richard Cleve,
Michele Mosca,
Ronald de Wolf:
Quantum lower bounds by polynomials.
J. ACM 48(4): 778-797 (2001) |
| 74 | | Andris Ambainis,
Harry Buhrman,
William I. Gasarch,
Bala Kalyanasundaram,
Leen Torenvliet:
The Communication Complexity of Enumeration, Elimination, and Selection.
J. Comput. Syst. Sci. 63(2): 148-185 (2001) |
| 73 | EE | Harry Buhrman,
Luc Longpré:
Compressibility and Resource Bounded Measure.
SIAM J. Comput. 31(3): 876-886 (2001) |
| 72 | EE | Harry Buhrman,
Lance Fortnow,
Sophie Laplante:
Resource-Bounded Kolmogorov Complexity Revisited.
SIAM J. Comput. 31(3): 887-905 (2001) |
| 2000 |
|---|
| 71 | EE | Harry Buhrman,
Alessandro Panconesi,
Riccardo Silvestri,
Paul M. B. Vitányi:
On the Importance of Having an Identity or is Consensus Really Universal?
DISC 2000: 134-148 |
| 70 | EE | Harry Buhrman,
Sophie Laplante,
Peter Bro Miltersen:
New Bounds for the Language Compression Problem.
IEEE Conference on Computational Complexity 2000: 126-130 |
| 69 | EE | 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: 44-53 |
| 68 | EE | Harry Buhrman,
Stephen A. Fenner,
Lance Fortnow,
Dieter van Melkebeek:
Optimal Proof Systems and Sparse Sets.
STACS 2000: 407-418 |
| 67 | EE | Harry Buhrman,
Peter Bro Miltersen,
Jaikumar Radhakrishnan,
Srinivasan Venkatesh:
Are bitvectors optimal?
STOC 2000: 449-458 |
| 66 | | Harry Buhrman:
Quantum Computing and Communication Complexity.
Bulletin of the EATCS 70: 131-141 (2000) |
| 65 | | Harry Buhrman,
Lance Fortnow,
Dieter van Melkebeek,
Leen Torenvliet:
Separating Complexity Classes Using Autoreducibility.
SIAM J. Comput. 29(5): 1497-1520 (2000) |
| 64 | | Harry 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.
SIAM J. Comput. 30(2): 576-601 (2000) |
| 63 | EE | Harry Buhrman,
Leen Torenvliet:
Randomness is Hard.
SIAM J. Comput. 30(5): 1485-1501 (2000) |
| 62 | EE | Harry Buhrman,
Richard Cleve,
Wim van Dam:
Quantum Entanglement and Communication Complexity.
SIAM J. Comput. 30(6): 1829-1841 (2000) |
| 61 | EE | Harry Buhrman,
Tao Jiang,
Ming Li,
Paul M. B. Vitányi:
New applications of the incompressibility method: Part II.
Theor. Comput. Sci. 235(1): 59-70 (2000) |
| 1999 |
|---|
| 60 | EE | Harry Buhrman,
Richard Cleve,
Ronald de Wolf,
Christof Zalka:
Bounds for Small-Error and Zero-Error Quantum Algorithms.
FOCS 1999: 358-368 |
| 59 | EE | Harry Buhrman,
Tao Jiang,
Ming Li,
Paul M. B. Vitányi:
New Applications of the Incompressibility Method.
ICALP 1999: 220-229 |
| 58 | EE | Harry Buhrman,
Wim van Dam:
Quantum Bounded Query Complexity.
IEEE Conference on Computational Complexity 1999: 149- |
| 57 | EE | Harry Buhrman,
Leen Torenvliet:
Complicated Complementations.
IEEE Conference on Computational Complexity 1999: 227-236 |
| 56 | EE | Harry Buhrman,
Lance Fortnow:
One-sided Versus Two-sided Error in Probabilistic Computation.
STACS 1999: 100-109 |
| 55 | EE | Harry Buhrman,
Richard Cleve,
Ronald de Wolf,
Christof Zalka:
Bounds for Small-Error and Zero-Error Quantum Algorithms
CoRR cs.CC/9904019: (1999) |
| 54 | EE | Harry Buhrman,
Ronald de Wolf:
Communication Complexity Lower Bounds by Polynomials
CoRR cs.CC/9910010: (1999) |
| 53 | EE | Harry Buhrman,
Jaap-Henk Hoepman,
Paul M. B. Vitányi:
Space-Efficient Routing Tables for Almost All Networks and the Incompressibility Method
CoRR cs.DC/9903009: (1999) |
| 52 | EE | Harry Buhrman,
Matthew K. Franklin,
Juan A. Garay,
Jaap-Henk Hoepman,
John Tromp,
Paul M. B. Vitányi:
Mutual Search
CoRR cs.DS/9902005: (1999) |
| 51 | EE | Harry Buhrman,
Wim van Dam:
Quantum Bounded Query Complexity
CoRR quant-ph/9903035: (1999) |
| 50 | EE | Harry Buhrman,
Ronald de Wolf:
A Lower Bound for Quantum Search of an Ordered List.
Inf. Process. Lett. 70(5): 205-209 (1999) |
| 49 | EE | Harry Buhrman,
Matthew K. Franklin,
Juan A. Garay,
Jaap-Henk Hoepman,
John Tromp,
Paul M. B. Vitányi:
Mutual Search.
J. ACM 46(4): 517-536 (1999) |
| 48 | | Harry Buhrman,
Lance Fortnow:
Two Queries.
J. Comput. Syst. Sci. 59(2): 182-194 (1999) |
| 47 | | Harry Buhrman,
Dieter van Melkebeek:
Hard Sets Are Hard to Find.
J. Comput. Syst. Sci. 59(2): 327-345 (1999) |
| 46 | | Harry Buhrman,
Jaap-Henk Hoepman,
Paul M. B. Vitányi:
Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method.
SIAM J. Comput. 28(4): 1414-1432 (1999) |
| 45 | | Harry Buhrman,
Ming Li,
John Tromp,
Paul M. B. Vitányi:
Kolmogorov Random Graphs and the Incompressibility Method.
SIAM J. Comput. 29(2): 590-599 (1999) |
| 1998 |
|---|
| 44 | EE | Robert Beals,
Harry Buhrman,
Richard Cleve,
Michele Mosca,
Ronald de Wolf:
Quantum Lower Bounds by Polynomials.
FOCS 1998: 352-361 |
| 43 | EE | Harry Buhrman,
Lance Fortnow:
Two Queries.
IEEE Conference on Computational Complexity 1998: 13- |
| 42 | EE | Harry Buhrman,
Dieter van Melkebeek:
Hard Sets are Hard to Find.
IEEE Conference on Computational Complexity 1998: 170-181 |
| 41 | EE | Harry Buhrman,
Leen Torenvliet:
Randomness is Hard.
IEEE Conference on Computational Complexity 1998: 249-260 |
| 40 | EE | Harry Buhrman,
Lance Fortnow,
Thomas Thierauf:
Nonrelativizing Separations.
IEEE Conference on Computational Complexity 1998: 8-12 |
| 39 | | Harry Buhrman,
Matthew K. Franklin,
Juan A. Garay,
Jaap-Henk Hoepman,
John Tromp,
Paul M. B. Vitányi:
Mutual Search (Extended Abstract).
SODA 1998: 481-489 |
| 38 | | Harry Buhrman,
Dieter van Melkebeek,
Kenneth W. Regan,
D. Sivakumar,
Martin Strauss:
A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract).
STACS 1998: 161-171 |
| 37 | EE | Richard Beigel,
Harry Buhrman,
Lance Fortnow:
NP Might Not Be As Easy As Detecting Unique Solutions.
STOC 1998: 203-208 |
| 36 | EE | Harry Buhrman,
Richard Cleve,
Avi Wigderson:
Quantum vs. Classical Communication and Computation.
STOC 1998: 63-68 |
| 35 | EE | Harry Buhrman,
Tao Jiang,
Ming Li,
Paul M. B. Vitányi:
New Applications of the Incompressibility Method: Part II
CoRR cs.CC/9809060: (1998) |
| 34 | EE | Robert Beals,
Harry Buhrman,
Richard Cleve,
Michele Mosca,
Ronald de Wolf:
Quantum Lower Bounds by Polynomials
CoRR quant-ph/9802049: (1998) |
| 33 | EE | Harry Buhrman,
Ronald de Wolf:
Lower Bounds for Quantum Search and Derandomization
CoRR quant-ph/9811046: (1998) |
| 32 | EE | Harry Buhrman,
Dieter van Melkebeek,
Kenneth W. Regan,
Martin Strauss,
D. Sivakumar:
A Generalization of Resource-Bounded Measure, With Application to the BPP vs. EXP Problem
Electronic Colloquium on Computational Complexity (ECCC) 5(58): (1998) |
| 31 | | Harry Buhrman,
Albrecht Hoene,
Leen Torenvliet:
Splittings, Robustness, and Structure of Complete Sets.
SIAM J. Comput. 27(3): 637-653 (1998) |
| 30 | | Harry Buhrman,
Jim Kadin,
Thomas Thierauf:
Functions Computable with Nonadaptive Queries to NP.
Theory Comput. Syst. 31(1): 77-92 (1998) |
| 1997 |
|---|
| 29 | | Harry Buhrman,
Stephen A. Fenner,
Lance Fortnow:
Results on Resource-Bounded Measure.
ICALP 1997: 188-194 |
| 28 | EE | Harry Buhrman,
Lance Fortnow,
Leen Torenvliet:
Six Hypotheses in Search of a Theorem.
IEEE Conference on Computational Complexity 1997: 2-12 |
| 27 | | Harry Buhrman,
Lance Fortnow:
Resource-Bounded Kolmogorov Complexity Revisited.
STACS 1997: 105-116 |
| 26 | | Harry Buhrman,
Elvira Mayordomo:
An Excursion to the Kolmogorov Random Strings.
J. Comput. Syst. Sci. 54(3): 393-399 (1997) |
| 1996 |
|---|
| 25 | | Harry Buhrman,
Jaap-Henk Hoepman,
Paul M. B. Vitányi:
Optimal Routing Tables.
PODC 1996: 134-142 |
| 24 | | Harry Buhrman,
Luc Longpré:
Compressibility and Resource Bounded Measure.
STACS 1996: 13-24 |
| 23 | | Harry Buhrman,
Thomas Thierauf:
The Complexity of Generating and Checking Proffs of Membership.
STACS 1996: 75-86 |
| 22 | | Harry Buhrman,
Leen Torenvliet:
P-Selektive Self-Reducible Sets: A New Characterization of P.
J. Comput. Syst. Sci. 53(2): 210-217 (1996) |
| 21 | | Harry Buhrman,
Pekka Orponen:
Random Strings Make Hard Instances.
J. Comput. Syst. Sci. 53(2): 261-266 (1996) |
| 1995 |
|---|
| 20 | | José L. Balcázar,
Harry Buhrman,
Montserrat Hermo:
Learnability of Kolmogorov-easy circuit expressions via queries.
EuroCOLT 1995: 112-124 |
| 19 | | Harry Buhrman,
Lance Fortnow,
Leen Torenvliet:
Using Autoreducibility to Separate Complexity Classes.
FOCS 1995: 520-527 |
| 18 | | Harry Buhrman,
Juan A. Garay,
Jaap-Henk Hoepman:
Optimal Resiliency against Mobile Faults.
FTCS 1995: 83-88 |
| 17 | | Harry Buhrman,
Juan A. Garay,
Jaap-Henk Hoepman,
Mark Moir:
Long-Lived Renaming Made Fast.
PODC 1995: 194-203 |
| 16 | | Harry Buhrman,
Montserrat Hermo:
On the Sparse Set Conjecture for Sets with Low Denisty.
STACS 1995: 609-618 |
| 15 | | Harry Buhrman,
Elvira Mayordomo:
An Excursion to the Kolmogorov Random Strings.
Structure in Complexity Theory Conference 1995: 197-203 |
| 14 | | Harry Buhrman,
Edith Hemaspaandra,
Luc Longpré:
SPARSE Reduces Conjunctively to TALLY.
SIAM J. Comput. 24(4): 673-681 (1995) |
| 1994 |
|---|
| 13 | | Harry Buhrman,
Leen Torenvliet:
On the Cutting Edge of Relativization: The Resource Bounded Injury Method.
ICALP 1994: 263-273 |
| 12 | | Harry Buhrman,
Leen Torenvliet:
On the Structure of Complete Sets.
Structure in Complexity Theory Conference 1994: 118-133 |
| 11 | | Harry Buhrman,
Pekka Orponen:
Random Strings Make Hard Instances.
Structure in Complexity Theory Conference 1994: 217-222 |
| 10 | | Harry Buhrman,
Jim Kadin,
Thomas Thierauf:
On Functions Computable with Nonadaptive Queries to NP.
Structure in Complexity Theory Conference 1994: 43-52 |
| 1993 |
|---|
| 9 | | Harry Buhrman,
Albrecht Hoene,
Leen Torenvliet:
Splittings, Robustness and Structure of Complete Sets.
STACS 1993: 175-184 |
| 8 | | Harry Buhrman,
Luc Longpré,
Edith Spaan:
SPARSE reduces conjunctively to TALLY.
Structure in Complexity Theory Conference 1993: 208-214 |
| 7 | | Harry Buhrman,
Peter van Helden,
Leen Torenvliet:
P-Selective Self-reducibles Sets: A New Characterization of P.
Structure in Complexity Theory Conference 1993: 44-51 |
| 6 | | Harry Buhrman,
Edith Spaan,
Leen Torenvliet:
The Relative Power of Logspace and Polynomial Time Reductions.
Computational Complexity 3: 231-244 (1993) |
| 5 | | Harry Buhrman,
Leen Torenvliet,
Peter van Emde Boas:
Twenty Questions to a P-Selector.
Inf. Process. Lett. 48(4): 201-204 (1993) |
| 1992 |
|---|
| 4 | | Harry Buhrman,
Edith Spaan,
Leen Torenvliet:
Bounded Reductions.
Complexity Theory: Current Research 1992: 83-99 |
| 3 | | Harry Buhrman,
Steven Homer:
Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy.
FSTTCS 1992: 116-127 |
| 1991 |
|---|
| 2 | | Harry Buhrman,
Edith Spaan,
Leen Torenvliet:
Bounded Reductions.
STACS 1991: 410-421 |
| 1 | | Harry Buhrman,
Steven Homer,
Leen Torenvliet:
Completeness for Nondeterministic Complexity Classes.
Mathematical Systems Theory 24(3): 179-200 (1991) |
