The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ronald de Wolf: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Shan-Hwei Nienhuys-Cheng, Ronald de Wolf
    The Equivalence of the Subsumption Theorem and the Refutation-Completeness for Unconstrained Resolution. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1995, pp:269-285 [Conf]
  2. 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]
  3. 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]
  4. Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
    Strengths and Weaknesses of Quantum Fingerprinting. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:288-298 [Conf]
  5. Ronald de Wolf
    Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:271-278 [Conf]
  6. Shan-Hwei Nienhuys-Cheng, Ronald de Wolf
    A Complete Method for Program Specialization Based on Unfolding. [Citation Graph (0, 0)][DBLP]
    ECAI, 1996, pp:438-442 [Conf]
  7. Andris Ambainis, Michele Mosca, Alain Tapp, Ronald de Wolf
    Private Quantum Channels. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:547-553 [Conf]
  8. 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]
  9. 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]
  10. Hartmut Klauck, Robert Spalek, Ronald de Wolf
    Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:12-21 [Conf]
  11. Peter Høyer, Michele Mosca, Ronald de Wolf
    Quantum Search on Bounded-Error Inputs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:291-299 [Conf]
  12. Stephanie Wehner, Ronald de Wolf
    Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1424-1436 [Conf]
  13. Ronald de Wolf
    Lower Bounds on Matrix Rigidity Via a Quantum Argument. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:62-71 [Conf]
  14. Shan-Hwei Nienhuys-Cheng, Ronald de Wolf
    Least Generalizations under Implication. [Citation Graph (0, 0)][DBLP]
    Inductive Logic Programming Workshop, 1996, pp:285-298 [Conf]
  15. Andris Ambainis, Ronald de Wolf
    Average-Case Quantum Query Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:133-144 [Conf]
  16. 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]
  17. Mart de Graaf, Ronald de Wolf
    On Quantum Versions of the Yao Principle. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:347-358 [Conf]
  18. Vesa Halava, Mika Hirvensalo, Ronald de Wolf
    Decidability and Undecidability of Marked PCP. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:207-216 [Conf]
  19. Peter Høyer, Ronald de Wolf
    Improved Quantum Communication Complexity Bounds for Disjointness and Equality. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:299-310 [Conf]
  20. Andris Ambainis, Robert Spalek, Ronald de Wolf
    A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:618-633 [Conf]
  21. Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf
    Bounded-error quantum state identification and exponential separations in communication complexity. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:594-603 [Conf]
  22. Iordanis Kerenidis, Ronald de Wolf
    Exponential lower bound for 2-query locally decodable codes via a quantum argument. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:106-115 [Conf]
  23. Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf
    Algorithmic Clustering of Music. [Citation Graph (0, 0)][DBLP]
    WEDELMUSIC, 2004, pp:110-117 [Conf]
  24. Shan-Hwei Nienhuys-Cheng, Ronald de Wolf
    Least Generalizations and Greatest Specializations of Sets of Clauses [Citation Graph (0, 0)][DBLP]
    CoRR, 1996, v:0, n:, pp:- [Journal]
  25. Ronald de Wolf
    Nondeterministic Quantum Query and Quantum Communication Complexities [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  26. 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]
  27. Harry Buhrman, Ronald de Wolf
    Communication Complexity Lower Bounds by Polynomials [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  28. Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf
    Algorithmic Clustering of Music [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  29. Peter Høyer, Ronald de Wolf
    Improved Quantum Communication Complexity Bounds for Disjointness and Equality [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  30. Mart de Graaf, Ronald de Wolf
    On Quantum Versions of the Yao Principle [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  31. Iordanis Kerenidis, Ronald de Wolf
    Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  32. Harry Buhrman, Ronald de Wolf
    Quantum Zero-Error Algorithms Cannot be Composed [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  33. Peter Høyer, Michele Mosca, Ronald de Wolf
    Quantum Search on Bounded-Error Inputs [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  34. Iordanis Kerenidis, Ronald de Wolf
    Quantum Symmetrically-Private Information Retrieval [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  35. 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]
  36. Hartmut Klauck, Robert Spalek, Ronald de Wolf
    Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  37. Stephanie Wehner, Ronald de Wolf
    Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  38. Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
    Quantum Communication Cannot Simulate a Public Coin [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  39. 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]
  40. Harry Buhrman, Ronald de Wolf
    Lower Bounds for Quantum Search and Derandomization [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  41. Andris Ambainis, Ronald de Wolf
    Average-Case Quantum Query Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  42. Iordanis Kerenidis, Ronald de Wolf
    Exponential Lower Bound for 2-Query Locally Decodable Codes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:059, pp:- [Journal]
  43. Hartmut Klauck, Robert Spalek, Ronald de Wolf
    Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:045, pp:- [Journal]
  44. 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]
  45. 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]
  46. Iordanis Kerenidis, Ronald de Wolf
    Quantum symmetrically-private information retrieval. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:3, pp:109-114 [Journal]
  47. 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]
  48. Shan-Hwei Nienhuys-Cheng, Ronald de Wolf
    Least Generalizations and Greatest Specializations of Sets of Clauses. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 1996, v:4, n:, pp:341-363 [Journal]
  49. Iordanis Kerenidis, Ronald de Wolf
    Exponential lower bound for 2-query locally decodable codes via a quantum argument. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:3, pp:395-420 [Journal]
  50. 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]
  51. Ronald de Wolf
    Nondeterministic Quantum Query and Communication Complexities. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:3, pp:681-699 [Journal]
  52. Hartmut Klauck, Robert Spalek, Ronald de Wolf
    Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1472-1493 [Journal]
  53. 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]
  54. Vesa Halava, Mika Hirvensalo, Ronald de Wolf
    Marked PCP is decidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:193-204 [Journal]
  55. Ronald de Wolf
    Quantum communication and complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:1, pp:337-353 [Journal]
  56. 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]
  57. Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf
    Exponential separations for one-way quantum communication complexity, with applications to cryptography. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:516-525 [Conf]
  58. Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
    Strengths and Weaknesses of Quantum Fingerprinting [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  59. Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
    Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  60. 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]

  61. Better Gap-Hamming Lower Bounds via Better Round Elimination. [Citation Graph (, )][DBLP]


  62. A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs. [Citation Graph (, )][DBLP]


  63. Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. [Citation Graph (, )][DBLP]


  64. Locally Decodable Quantum Codes. [Citation Graph (, )][DBLP]


  65. Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation. [Citation Graph (, )][DBLP]


  66. Error-Correcting Data Structures. [Citation Graph (, )][DBLP]


  67. A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs. [Citation Graph (, )][DBLP]


  68. Lower Bounds on Matrix Rigidity via a Quantum Argument [Citation Graph (, )][DBLP]


  69. Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity [Citation Graph (, )][DBLP]


  70. A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs [Citation Graph (, )][DBLP]


  71. Error-Correcting Data Structures [Citation Graph (, )][DBLP]


  72. Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation [Citation Graph (, )][DBLP]


  73. Quantum Proofs for Classical Theorems [Citation Graph (, )][DBLP]


  74. Better Gap-Hamming Lower Bounds via Better Round Elimination [Citation Graph (, )][DBLP]


  75. New Results on Quantum Property Testing [Citation Graph (, )][DBLP]


  76. Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.009secs
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