| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Hartmut Klauck, Ronald de Wolf |
Fooling One-Sided Quantum Protocols  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf |
New bounds on the classical and quantum communication complexity of some graph properties |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf |
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Drucker, Ronald de Wolf |
Quantum Proofs for Classical Theorems. |
Theory of Computing, Graduate Surveys |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Drucker, Ronald de Wolf |
Uniform approximation by (quantum) polynomials. |
Quantum Information & Computation |
2011 |
DBLP BibTeX RDF |
|
| 1 | Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf |
Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ronald de Wolf |
Bell Inequalities: What Do We Know about Them and Why Should Cryptographers Care? - (Invited Talk). |
ICITS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf |
Near-Optimal and Explicit Bell Inequality Violations. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf |
Upper bounds on the noise threshold for fault-tolerant quantum computing. |
Quantum Information & Computation |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ronald de Wolf |
A note on quantum algorithms and the minimal degree of ε-error polynomials for symmetric functions. |
Quantum Information & Computation |
2010 |
DBLP BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf |
New Results on Quantum Property Testing |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Victor Chen, Elena Grigorescu, Ronald de Wolf |
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf |
Better Gap-Hamming Lower Bounds via Better Round Elimination. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf |
New Results on Quantum Property Testing. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chen, Elena Grigorescu, Ronald de Wolf |
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andrew Drucker, Ronald de Wolf |
Quantum Proofs for Classical Theorems. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Robert Spalek, Ronald de Wolf |
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Quantum lower bounds, Boolean functions, Quantum computing, Quantum algorithms, Time-space tradeoffs |
| 1 | Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf |
Better Gap-Hamming Lower Bounds via Better Round Elimination |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andrew Drucker, Ronald de Wolf |
Quantum Proofs for Classical Theorems |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Victor Chen, Elena Grigorescu, Ronald de Wolf |
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf |
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald de Wolf |
Error-Correcting Data Structures. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jop Briët, Ronald de Wolf |
Locally Decodable Quantum Codes. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Oded Regev, Ronald de Wolf |
Simultaneous Communication Protocols with Quantum and Classical Messages. |
Chicago J. Theor. Comput. Sci. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ronald de Wolf |
A Brief Introduction to Fourier Analysis on the Boolean Cube. |
Theory of Computing, Graduate Surveys |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald de Wolf |
Error-Correcting Data Structures |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf |
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf |
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Avraham Ben-Aroya, Oded Regev, Ronald de Wolf |
A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf |
Robust Polynomials and Quantum Algorithms. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald de Wolf |
Joint review of "An Introduction to Quantum Computing Algorithms by Arthur O. Pittenger, " Birkhäuser, ISBN: 0817641270; Quantum Computing by Mika Hirvensalo, " Springer, ISBN: 3540667830; and "Classical and Quantum Computation by A. Yu. Kitaev, A. Shen, and M. N. Vyalyi, " American Mathematical Society, ISBN: 082182161X. |
SIGACT News |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Klauck, Robert Spalek, Ronald de Wolf |
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Nikolai K. Vereshchagin, Ronald de Wolf |
On Computation and Communication with Small Bias. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf |
Exponential separations for one-way quantum communication complexity, with applications to cryptography. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
cryptography, communication complexity, quantum |
| 1 | Dmitry Gavinsky, Julia Kempe, Ronald de Wolf |
Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Ronald de Wolf |
Strengths and Weaknesses of Quantum Fingerprinting |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Ronald de Wolf |
Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Ronald de Wolf |
Lower Bounds on Matrix Rigidity Via a Quantum Argument. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Ronald de Wolf |
Strengths and Weaknesses of Quantum Fingerprinting. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf |
Bounded-error quantum state identification and exponential separations in communication complexity. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
quantum computing, randomness, communication complexity, entanglement, state identification |
| 1 | Andris Ambainis, Robert Spalek, Ronald de Wolf |
A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
lower bounds, quantum computing, time-space tradeoffs, direct product theorems |
| 1 | Ronald de Wolf |
Lower Bounds on Matrix Rigidity via a Quantum Argument |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Robert Spalek, Ronald de Wolf |
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf |
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephanie Wehner, Ronald de Wolf |
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf |
Robust Polynomials and Quantum Algorithms. |
STACS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Iordanis Kerenidis, Ronald de Wolf |
Quantum symmetrically-private information retrieval. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Klauck, Robert Spalek, Ronald de Wolf |
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Ronald de Wolf |
Quantum Communication Cannot Simulate a Public Coin |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Hartmut Klauck, Robert Spalek, Ronald de Wolf |
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Stephanie Wehner, Ronald de Wolf |
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Iordanis Kerenidis, Ronald de Wolf |
Exponential lower bound for 2-query locally decodable codes via a quantum argument. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf |
Algorithmic Clustering of Music. |
WEDELMUSIC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Klauck, Robert Spalek, Ronald de Wolf |
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Ronald de Wolf |
Quantum zero-error algorithms cannot be composed. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald de Wolf |
Book review. |
Quantum Information & Computation |
2003 |
DBLP BibTeX RDF |
|
| 1 | Iordanis Kerenidis, Ronald de Wolf |
Quantum Symmetrically-Private Information Retrieval |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf |
Algorithmic Clustering of Music |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Peter Høyer, Michele Mosca, Ronald de Wolf |
Quantum Search on Bounded-Error Inputs |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf |
Robust Quantum Algorithms and Polynomials |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Ronald de Wolf |
Nondeterministic Quantum Query and Communication Complexities. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Høyer, Michele Mosca, Ronald de Wolf |
Quantum Search on Bounded-Error Inputs. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Iordanis Kerenidis, Ronald de Wolf |
Exponential lower bound for 2-query locally decodable codes via a quantum argument. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
quantum computing, private information retrieval, locally decodable codes |
| 1 | Iordanis Kerenidis, Ronald de Wolf |
Exponential Lower Bound for 2-Query Locally Decodable Codes |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Harry Buhrman, Ronald de Wolf |
Complexity measures and decision tree complexity: a survey. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald de Wolf |
Quantum communication and complexity. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Iordanis Kerenidis, Ronald de Wolf |
Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Harry Buhrman, Ronald de Wolf |
Quantum Zero-Error Algorithms Cannot be Composed |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Mart de Graaf, Ronald de Wolf |
On Quantum Versions of the Yao Principle. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Høyer, Ronald de Wolf |
Improved Quantum Communication Complexity Bounds for Disjointness and Equality. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Vesa Halava, Mika Hirvensalo, Ronald de Wolf |
Marked PCP is decidable. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf |
Quantum lower bounds by polynomials. |
J. ACM |
2001 |
DBLP DOI BibTeX RDF |
polynomial method, lower bounds, Quantum computing, query complexity, black-box model |
| 1 | Mart de Graaf, Ronald de Wolf |
On Quantum Versions of the Yao Principle |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | Peter Høyer, Ronald de Wolf |
Improved Quantum Communication Complexity Bounds for Disjointness and Equality |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | Harry Buhrman, Ronald de Wolf |
Communication Complexity Lower Bounds by Polynomials. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry 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) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald de Wolf |
Nondeterministic Quantum Query and Quantum Communication Complexities |
CoRR |
2000 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Ronald de Wolf |
Average-Case Quantum Query Complexity. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Michele Mosca, Alain Tapp, Ronald de Wolf |
Private Quantum Channels. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
private quantum channels, classical private key, insecure one-way quantum channel, private communication, one-time pad encryption scheme, cryptography, quantum computing, qubits, quantum information |
| 1 | Ronald de Wolf |
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity. (PDF / PS) |
IEEE Conference on Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
non-deterministic computation, Quantum computing, communication complexity, query complexity |
| 1 | Harry Buhrman, Ronald de Wolf |
A Lower Bound for Quantum Search of an Ordered List. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka |
Bounds for Small-Error and Zero-Error Quantum Algorithms |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Ronald de Wolf |
Average-Case Quantum Query Complexity |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Harry Buhrman, Ronald de Wolf |
Communication Complexity Lower Bounds by Polynomials |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Vesa Halava, Mika Hirvensalo, Ronald de Wolf |
Decidability and Undecidability of Marked PCP. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka |
Bounds for Small-Error and Zero-Error Quantum Algorithms. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
amplification, Quantum computing, communication complexity, graph properties |
| 1 | Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf |
Quantum Lower Bounds by Polynomials |
CoRR |
1998 |
DBLP BibTeX RDF |
|
| 1 | Harry Buhrman, Ronald de Wolf |
Lower Bounds for Quantum Search and Derandomization |
CoRR |
1998 |
DBLP BibTeX RDF |
|
| 1 | Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf |
Quantum Lower Bounds by Polynomials. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
Black-box computation, Decision trees, Quantum computation, Complexity theory |
| 1 | Shan-Hwei Nienhuys-Cheng, Ronald de Wolf (eds.) |
Foundations of Inductive Logic Programming |
|
1997 |
DOI RDF |
|
| 1 | Shan-Hwei Nienhuys-Cheng, Ronald de Wolf |
Least Generalizations and Greatest Specializations of Sets of Clauses |
CoRR |
1996 |
DBLP BibTeX RDF |
|
| 1 | Shan-Hwei Nienhuys-Cheng, Ronald de Wolf |
Least Generalizations and Greatest Specializations of Sets of Clauses. |
J. Artif. Intell. Res. (JAIR) |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Shan-Hwei Nienhuys-Cheng, Ronald de Wolf |
A Complete Method for Program Specialization Based on Unfolding. |
ECAI |
1996 |
DBLP BibTeX RDF |
|
| 1 | Shan-Hwei Nienhuys-Cheng, Ronald de Wolf |
Least Generalizations under Implication. |
Inductive Logic Programming Workshop |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Shan-Hwei Nienhuys-Cheng, Ronald de Wolf |
The Equivalence of the Subsumption Theorem and the Refutation-Completeness for Unconstrained Resolution. |
ASIAN |
1995 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")