The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Harry Buhrman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  125. Randomised Individual Communication Complexity. [Citation Graph (, )][DBLP]


  126. NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly. [Citation Graph (, )][DBLP]


  127. Derandomizing from Random Strings. [Citation Graph (, )][DBLP]


  128. 07411 Executive Summary -- Algebraic Methods in Computational Complexity. [Citation Graph (, )][DBLP]


  129. 07411 Abstracts Collection -- Algebraic Methods in Computational Complexity. [Citation Graph (, )][DBLP]


  130. High Entropy Random Selection Protocols. [Citation Graph (, )][DBLP]


  131. Unconditional Lower Bounds against Advice. [Citation Graph (, )][DBLP]


  132. Derandomizing from Random Strings [Citation Graph (, )][DBLP]


  133. NP-Hard Sets are Exponentially Dense Unless NP is contained in coNP/poly. [Citation Graph (, )][DBLP]


  134. Inverting onto functions might not be hard. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.016secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002