Ronald de Wolf

178 papers A* 20A 26B 1C 1Journal 118Unranked 11

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix. SODA Yanlin Chen, András Gilyén, Ronald de Wolf
2025	J	`jnl`	An Improved Quantum Algorithm for 3-Tuple Lattice Sieving. CoRR Lynn Engelberts, Yanlin Chen, Amin Shiraz Gilani, Maya-Iggy van Hoof, Stacey Jeffery, Ronald de Wolf
2025	J	`jnl`	An Improved Quantum Algorithm for 3-Tuple Lattice Sieving. IACR Cryptol. ePrint Arch. Lynn Engelberts, Yanlin Chen, Amin Shiraz Gilani, Maya-Iggy van Hoof, Stacey Jeffery, Ronald de Wolf
2025	J	`jnl`	Getting almost all the bits from a quantum random access code. CoRR Han-Hsuan Lin, Ronald de Wolf
2024	J	`jnl`	A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix. CoRR Yanlin Chen, András Gilyén, Ronald de Wolf
2024	J	`jnl`	Generating k EPR-pairs from an n-party resource state. Quantum Sergey Bravyi, Yash Sharma, Mario Szegedy, Ronald de Wolf
2023	A	`conf`	Improved Quantum Boosting. ESA Adam Izdebski, Ronald de Wolf
2023	A*	`conf`	Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints. ICALP Yanlin Chen, Ronald de Wolf
2023	A	`conf`	Tight Bounds for Quantum Phase Estimation and Related Problems. ESA Nikhil S. Mande, Ronald de Wolf
2023	J	`jnl`	Tight Bounds for Quantum Phase Estimation and Related Problems. CoRR Nikhil S. Mande, Ronald de Wolf
2023	—	`conf`	Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. FSTTCS Olivier Lalonde, Nikhil S. Mande, Ronald de Wolf
2022	J	`jnl`	Average-Case Verification of the Quantum Fourier Transform Enables Worst-Case Phase Estimation. Quantum Noah Linden, Ronald de Wolf
2022	A	`conf`	Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum Algorithms. CCC Nikhil Bansal, Makrand Sinha, Ronald de Wolf
2022	J	`jnl`	Influence in Completely Bounded Block-multilinear Forms and Classical Simulation of Quantum Algorithms. CoRR Nikhil Bansal, Makrand Sinha, Ronald de Wolf
2022	J	`jnl`	Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving. SIAM J. Comput. Simon Apers, Ronald de Wolf
2022	A	`conf`	Symmetry and Quantum Query-To-Communication Simulation. STACS Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf
2021	J	`jnl`	A Guide for New Program Committee Members at Theoretical Computer Science Conferences. CoRR Yfke Dulek, Stacey Jeffery, Christian Majenz, Christian Schaffner, Florian Speelman, Ronald de Wolf
2021	J	`jnl`	Exact quantum query complexity of computing Hamming weight modulo powers of two and three. CoRR Arjan Cornelissen, Nikhil S. Mande, Maris Ozols, Ronald de Wolf
2021	J	`jnl`	Improved Bounds on Fourier Entropy and Min-entropy. ACM Trans. Comput. Theory Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf
2021	J	`jnl`	Lightweight Detection of a Small Number of Large Errors in a Quantum Circuit. Quantum Noah Linden, Ronald de Wolf
2021	J	`jnl`	Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints. CoRR Yanlin Chen, Ronald de Wolf
2021	A*	`conf`	Quantum Algorithms for Matrix Scaling and Matrix Balancing. ICALP Joran van Apeldoorn, Sander Gribling, Yinan Li, Harold Nieuwboer, Michael Walter, Ronald de Wolf
2021	J	`jnl`	Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. CoRR Nikhil S. Mande, Ronald de Wolf
2021	J	`jnl`	Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. Electron. Colloquium Comput. Complex. Nikhil S. Mande, Ronald de Wolf
2021	J	`jnl`	Two new results about quantum exact learning. Quantum Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, Ronald de Wolf
2020	J	`jnl`	Convex optimization using quantum oracles. Quantum Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf
2020	A	`conf`	Improved Bounds on Fourier Entropy and Min-Entropy. STACS Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf
2020	J	`jnl`	Improved Quantum Boosting. CoRR Adam Izdebski, Ronald de Wolf
2020	—	`conf`	Quantum Coupon Collector. TQC Srinivasan Arunachalam, Aleksandrs Belovs, Andrew M. Childs, Robin Kothari, Ansis Rosmanis, Ronald de Wolf
2020	J	`jnl`	Quantum Coupon Collector. CoRR Srinivasan Arunachalam, Aleksandrs Belovs, Andrew M. Childs, Robin Kothari, Ansis Rosmanis, Ronald de Wolf
2020	J	`jnl`	Quantum SDP-Solvers: Better upper and lower bounds. Quantum Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf
2020	A*	`conf`	Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving. FOCS Simon Apers, Ronald de Wolf
2020	J	`jnl`	Quantum algorithms for matrix scaling and matrix balancing. CoRR Joran van Apeldoorn, Sander Gribling, Yinan Li, Harold Nieuwboer, Michael Walter, Ronald de Wolf
2020	J	`jnl`	Symmetry and Quantum Query-to-Communication Simulation. CoRR Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf
2019	A*	`conf`	Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. FOCS Makrand Sinha, Ronald de Wolf
2019	J	`jnl`	Quantum Computing: Lecture Notes. CoRR Ronald de Wolf
2019	J	`jnl`	Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving. CoRR Simon Apers, Ronald de Wolf
2019	A*	`conf`	Two New Results About Quantum Exact Learning. ICALP Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, Ronald de Wolf
2018	C	`conf`	Attacks on the AJPS Mersenne-Based Cryptosystem. PQCrypto Koen de Boer, Léo Ducas, Stacey Jeffery, Ronald de Wolf
2018	J	`jnl`	Convex optimization using quantum oracles. CoRR Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf
2018	J	`jnl`	Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. CoRR Makrand Sinha, Ronald de Wolf
2018	J	`jnl`	Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. Electron. Colloquium Comput. Complex. Makrand Sinha, Ronald de Wolf
2018	J	`jnl`	Improved bounds on Fourier entropy and Min-entropy. CoRR Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf
2018	J	`jnl`	Improved bounds on Fourier entropy and Min-entropy. Electron. Colloquium Comput. Complex. Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf
2018	J	`jnl`	Optimal Quantum Sample Complexity of Learning Algorithms. J. Mach. Learn. Res. Srinivasan Arunachalam, Ronald de Wolf
2018	J	`jnl`	Two new results about quantum exact learning. CoRR Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Ronald de Wolf
2017	J	`jnl`	A Survey of Quantum Learning Theory. CoRR Srinivasan Arunachalam, Ronald de Wolf
2017	J	`jnl`	Attacks on the AJPS Mersenne-based cryptosystem. IACR Cryptol. ePrint Arch. Koen de Boer, Léo Ducas, Stacey Jeffery, Ronald de Wolf
2017	J	`jnl`	Guest Column: A Survey of Quantum Learning Theory. SIGACT News Srinivasan Arunachalam, Ronald de Wolf
2017	J	`jnl`	Optimal Parallel Quantum Query Algorithms. Algorithmica Stacey Jeffery, Frédéric Magniez, Ronald de Wolf
2017	A	`conf`	Optimal Quantum Sample Complexity of Learning Algorithms. CCC Srinivasan Arunachalam, Ronald de Wolf
2017	J	`jnl`	Optimizing the number of gates in quantum search. Quantum Inf. Comput. Srinivasan Arunachalam, Ronald de Wolf
2017	A*	`conf`	Quantum SDP-Solvers: Better Upper and Lower Bounds. FOCS Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf
2017	J	`jnl`	Quantum SDP-Solvers: Better upper and lower bounds. CoRR Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf
2017	J	`jnl`	Some upper and lower bounds on PSD-rank. Math. Program. Troy Lee, Zhaohui Wei, Ronald de Wolf
2017	J	`jnl`	The Potential Impact of Quantum Computers on Society. CoRR Ronald de Wolf
2017	J	`jnl`	The potential impact of quantum computers on society. Ethics Inf. Technol. Ronald de Wolf
2016	J	`jnl`	A Survey of Quantum Property Testing. Theory Comput. Ashley Montanaro, Ronald de Wolf
2016	A*	`conf`	Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing. SODA Andris Ambainis, Aleksandrs Belovs, Oded Regev, Ronald de Wolf
2016	A	`conf`	On the Sum-of-Squares Degree of Symmetric Quadratic Functions. CCC Troy Lee, Anupam Prakash, Ronald de Wolf, Henry Yuen
2016	J	`jnl`	On the sum-of-squares degree of symmetric quadratic functions. CoRR Troy Lee, Anupam Prakash, Ronald de Wolf, Henry Yuen
2016	J	`jnl`	Optimal Quantum Sample Complexity of Learning Algorithms. CoRR Srinivasan Arunachalam, Ronald de Wolf
2015	J	`jnl`	Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing. CoRR Andris Ambainis, Aleksandrs Belovs, Oded Regev, Ronald de Wolf
2015	J	`jnl`	Exponential Lower Bounds for Polytopes in Combinatorial Optimization. J. ACM Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf
2015	J	`jnl`	Optimizing the Number of Gates in Quantum Search. CoRR Srinivasan Arunachalam, Ronald de Wolf
2015	—	`conf`	Query Complexity in Expectation. ICALP (1) Jedrzej Kaniewski, Troy Lee, Ronald de Wolf
2015	J	`jnl`	Rational approximations and quantum algorithms with postselection. Quantum Inf. Comput. Urmila Mahadev, Ronald de Wolf
2014	J	`jnl`	How Low can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions? Comput. Complex. Andris Ambainis, Ronald de Wolf
2014	A	`conf`	Optimal Parallel Quantum Query Algorithms. ESA Stacey Jeffery, Frédéric Magniez, Ronald de Wolf
2014	J	`jnl`	Query complexity in expectation. CoRR Jedrzej Kaniewski, Troy Lee, Ronald de Wolf
2014	J	`jnl`	Rational approximations and quantum algorithms with postselection. CoRR Urmila Mahadev, Ronald de Wolf
2014	J	`jnl`	Some upper and lower bounds on PSD-rank. CoRR Troy Lee, Zhaohui Wei, Ronald de Wolf
2013	J	`jnl`	Error-Correcting Data Structures. SIAM J. Comput. Victor Chen, Elena Grigorescu, Ronald de Wolf
2013	A	`conf`	Fooling One-Sided Quantum Protocols. STACS Hartmut Klauck, Ronald de Wolf
2013	A	`conf`	How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions? CCC Andris Ambainis, Ronald de Wolf
2013	J	`jnl`	Optimal parallel quantum query algorithms. CoRR Stacey Jeffery, Frédéric Magniez, Ronald de Wolf
2013	A	`conf`	Optimal quantum query bounds for almost all Boolean functions. STACS Andris Ambainis, Arturs Backurs, Juris Smotrovs, Ronald de Wolf
2013	J	`jnl`	The non-adaptive query complexity of testing k-parities. Chic. J. Theor. Comput. Sci. Harry Buhrman, David García-Soriano, Arie Matsliah, Ronald de Wolf
2012	J	`jnl`	Fooling One-Sided Quantum Protocols CoRR Hartmut Klauck, Ronald de Wolf
2012	A*	`conf`	Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. STOC Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf
2012	J	`jnl`	Near-Optimal and Explicit Bell Inequality Violations. Theory Comput. Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf
2012	J	`jnl`	New bounds on the classical and quantum communication complexity of some graph properties CoRR Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf
2012	—	`conf`	New bounds on the classical and quantum communication complexity of some graph properties. FSTTCS Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf
2012	J	`jnl`	The non-adaptive query complexity of testing k-parities CoRR Harry Buhrman, David García-Soriano, Arie Matsliah, Ronald de Wolf
2011	—	`conf`	Bell Inequalities: What Do We Know about Them and Why Should Cryptographers Care? - (Invited Talk). ICITS Ronald de Wolf
2011	J	`jnl`	Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds CoRR Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf
2011	A	`conf`	Near-Optimal and Explicit Bell Inequality Violations. CCC Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf
2011	J	`jnl`	Quantum Proofs for Classical Theorems. Theory Comput. Andrew Drucker, Ronald de Wolf
2011	J	`jnl`	Uniform approximation by (quantum) polynomials. Quantum Inf. Comput. Andrew Drucker, Ronald de Wolf
2010	—	`conf`	Better Gap-Hamming Lower Bounds via Better Round Elimination. APPROX-RANDOM Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf
2010	A	`conf`	Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation. STACS Victor Chen, Elena Grigorescu, Ronald de Wolf
2010	J	`jnl`	New Results on Quantum Property Testing CoRR Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf
2010	—	`conf`	New Results on Quantum Property Testing. FSTTCS Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf
2010	J	`jnl`	Upper bounds on the noise threshold for fault-tolerant quantum computing. Quantum Inf. Comput. Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf
2009	J	`jnl`	A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs. Algorithmica Andris Ambainis, Robert Spalek, Ronald de Wolf
2009	J	`jnl`	Better Gap-Hamming Lower Bounds via Better Round Elimination CoRR Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf
2009	J	`jnl`	Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity. SIAM J. Comput. Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf
2009	J	`jnl`	Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation CoRR Victor Chen, Elena Grigorescu, Ronald de Wolf
2009	J	`jnl`	Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation. Electron. Colloquium Comput. Complex. Victor Chen, Elena Grigorescu, Ronald de Wolf
2009	A	`conf`	Error-Correcting Data Structures. STACS Ronald de Wolf
2009	A	`conf`	Locally Decodable Quantum Codes. STACS Jop Briët, Ronald de Wolf
2009	J	`jnl`	Quantum Proofs for Classical Theorems CoRR Andrew Drucker, Ronald de Wolf
2009	J	`jnl`	Quantum Proofs for Classical Theorems. Electron. Colloquium Comput. Complex. Andrew Drucker, Ronald de Wolf
2008	J	`jnl`	A Brief Introduction to Fourier Analysis on the Boolean Cube. Theory Comput. Ronald de Wolf
2008	A*	`conf`	A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs. FOCS Avraham Ben-Aroya, Oded Regev, Ronald de Wolf
2008	J	`jnl`	A note on quantum algorithms and the minimal degree of ε-error polynomials for symmetric functions. Quantum Inf. Comput. Ronald de Wolf
2008	J	`jnl`	Error-Correcting Data Structures CoRR Ronald de Wolf
2008	J	`jnl`	Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography. SIAM J. Comput. Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf
2008	J	`jnl`	Simultaneous Communication Protocols with Quantum and Classical Messages. Chic. J. Theor. Comput. Sci. Dmitry Gavinsky, Oded Regev, Ronald de Wolf
2008	—	`conf`	Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. ICALP (1) Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf
2007	A*	`conf`	Exponential separations for one-way quantum communication complexity, with applications to cryptography. STOC Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf
2007	J	`jnl`	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 Ronald de Wolf
2007	A	`conf`	On Computation and Communication with Small Bias. CCC Harry Buhrman, Nikolai K. Vereshchagin, Ronald de Wolf
2007	J	`jnl`	Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. SIAM J. Comput. Hartmut Klauck, Robert Spalek, Ronald de Wolf
2007	J	`jnl`	Robust Polynomials and Quantum Algorithms. Theory Comput. Syst. Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf
2006	A*	`conf`	A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs. STOC Andris Ambainis, Robert Spalek, Ronald de Wolf
2006	A*	`conf`	Bounded-error quantum state identification and exponential separations in communication complexity. STOC Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf
2006	J	`jnl`	Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function CoRR Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
2006	J	`jnl`	Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function. Electron. Colloquium Comput. Complex. Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
2006	—	`conf`	Lower Bounds on Matrix Rigidity Via a Quantum Argument. ICALP (1) Ronald de Wolf
2006	J	`jnl`	Strengths and Weaknesses of Quantum Fingerprinting CoRR Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
2006	A	`conf`	Strengths and Weaknesses of Quantum Fingerprinting. CCC Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
2005	J	`jnl`	A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs CoRR Andris Ambainis, Robert Spalek, Ronald de Wolf
2005	J	`jnl`	Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity CoRR Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf
2005	A*	`conf`	Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval. ICALP Stephanie Wehner, Ronald de Wolf
2005	J	`jnl`	Lower Bounds on Matrix Rigidity via a Quantum Argument CoRR Ronald de Wolf
2005	J	`jnl`	Quantum Algorithms for Element Distinctness. SIAM J. Comput. Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf
2005	A	`conf`	Robust Polynomials and Quantum Algorithms. STACS Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf
2004	J	`jnl`	Algorithmic Clustering of Music Based on String Compression. Comput. Music. J. Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf
2004	—	`conf`	Algorithmic Clustering of Music. WEDELMUSIC Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf
2004	J	`jnl`	Exponential lower bound for 2-query locally decodable codes via a quantum argument. J. Comput. Syst. Sci. Iordanis Kerenidis, Ronald de Wolf
2004	J	`jnl`	Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval CoRR Stephanie Wehner, Ronald de Wolf
2004	J	`jnl`	Quantum Communication Cannot Simulate a Public Coin CoRR Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
2004	J	`jnl`	Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs CoRR Hartmut Klauck, Robert Spalek, Ronald de Wolf
2004	J	`jnl`	Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs Electron. Colloquium Comput. Complex. Hartmut Klauck, Robert Spalek, Ronald de Wolf
2004	A*	`conf`	Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. FOCS Hartmut Klauck, Robert Spalek, Ronald de Wolf
2004	J	`jnl`	Quantum symmetrically-private information retrieval. Inf. Process. Lett. Iordanis Kerenidis, Ronald de Wolf
2003	J	`jnl`	Algorithmic Clustering of Music CoRR Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf
2003	J	`jnl`	Book reviews: On "An Introduction to Quantum Computing Algorithms" by A. O. Pittenger, "Quantum Computing" by M. Hirvensalo, and "Classical and Quantum Computation" by A. Yu. Kitaev, A. Shen, and M. N. Vyalyi. Quantum Inf. Comput. Ronald de Wolf
2003	A*	`conf`	Exponential lower bound for 2-query locally decodable codes via a quantum argument. STOC Iordanis Kerenidis, Ronald de Wolf
2003	J	`jnl`	Nondeterministic Quantum Query and Communication Complexities. SIAM J. Comput. Ronald de Wolf
2003	J	`jnl`	Quantum Search on Bounded-Error Inputs CoRR Peter Høyer, Michele Mosca, Ronald de Wolf
2003	A*	`conf`	Quantum Search on Bounded-Error Inputs. ICALP Peter Høyer, Michele Mosca, Ronald de Wolf
2003	J	`jnl`	Quantum Symmetrically-Private Information Retrieval CoRR Iordanis Kerenidis, Ronald de Wolf
2003	J	`jnl`	Quantum zero-error algorithms cannot be composed. Inf. Process. Lett. Harry Buhrman, Ronald de Wolf
2003	J	`jnl`	Robust Quantum Algorithms and Polynomials CoRR Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf
2002	J	`jnl`	Complexity measures and decision tree complexity: a survey. Theor. Comput. Sci. Harry Buhrman, Ronald de Wolf
2002	J	`jnl`	Exponential Lower Bound for 2-Query Locally Decodable Codes Electron. Colloquium Comput. Complex. Iordanis Kerenidis, Ronald de Wolf
2002	J	`jnl`	Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument CoRR Iordanis Kerenidis, Ronald de Wolf
2002	A	`conf`	Improved Quantum Communication Complexity Bounds for Disjointness and Equality. STACS Peter Høyer, Ronald de Wolf
2002	A	`conf`	On Quantum Versions of the Yao Principle. STACS Mart de Graaf, Ronald de Wolf
2002	J	`jnl`	Quantum Zero-Error Algorithms Cannot be Composed CoRR Harry Buhrman, Ronald de Wolf
2002	J	`jnl`	Quantum communication and complexity. Theor. Comput. Sci. Ronald de Wolf
2001	A	`conf`	Communication Complexity Lower Bounds by Polynomials. CCC Harry Buhrman, Ronald de Wolf
2001	J	`jnl`	Improved Quantum Communication Complexity Bounds for Disjointness and Equality CoRR Peter Høyer, Ronald de Wolf
2001	J	`jnl`	Marked PCP is decidable. Theor. Comput. Sci. Vesa Halava, Mika Hirvensalo, Ronald de Wolf
2001	J	`jnl`	On Quantum Versions of the Yao Principle CoRR Mart de Graaf, Ronald de Wolf
2001	A	`conf`	Quantum Algorithms for Element Distinctness. CCC Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf
2001	J	`jnl`	Quantum lower bounds by polynomials. J. ACM Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
2000	A	`conf`	Average-Case Quantum Query Complexity. STACS Andris Ambainis, Ronald de Wolf
2000	A	`conf`	Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity. CCC Ronald de Wolf
2000	J	`jnl`	Nondeterministic Quantum Query and Quantum Communication Complexities CoRR Ronald de Wolf
2000	A*	`conf`	Private Quantum Channels. FOCS Andris Ambainis, Michele Mosca, Alain Tapp, Ronald de Wolf
1999	J	`jnl`	A Lower Bound for Quantum Search of an Ordered List. Inf. Process. Lett. Harry Buhrman, Ronald de Wolf
1999	J	`jnl`	Average-Case Quantum Query Complexity CoRR Andris Ambainis, Ronald de Wolf
1999	J	`jnl`	Bounds for Small-Error and Zero-Error Quantum Algorithms CoRR Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka
1999	A*	`conf`	Bounds for Small-Error and Zero-Error Quantum Algorithms. FOCS Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka
1999	J	`jnl`	Communication Complexity Lower Bounds by Polynomials CoRR Harry Buhrman, Ronald de Wolf
1999	A	`conf`	Decidability and Undecidability of Marked PCP. STACS Vesa Halava, Mika Hirvensalo, Ronald de Wolf
1998	J	`jnl`	Lower Bounds for Quantum Search and Derandomization CoRR Harry Buhrman, Ronald de Wolf
1998	J	`jnl`	Quantum Lower Bounds by Polynomials CoRR Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
1998	A*	`conf`	Quantum Lower Bounds by Polynomials. FOCS Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
1997	—	`book`	Foundations of Inductive Logic Programming Shan-Hwei Nienhuys-Cheng, Ronald de Wolf
1996	A	`conf`	A Complete Method for Program Specialization Based on Unfolding. ECAI Shan-Hwei Nienhuys-Cheng, Ronald de Wolf
1996	J	`jnl`	Least Generalizations and Greatest Specializations of Sets of Clauses CoRR Shan-Hwei Nienhuys-Cheng, Ronald de Wolf
1996	J	`jnl`	Least Generalizations and Greatest Specializations of Sets of Clauses. J. Artif. Intell. Res. Shan-Hwei Nienhuys-Cheng, Ronald de Wolf
1996	B	`conf`	Least Generalizations under Implication. Inductive Logic Programming Workshop Shan-Hwei Nienhuys-Cheng, Ronald de Wolf
1995	—	`conf`	The Equivalence of the Subsumption Theorem and the Refutation-Completeness for Unconstrained Resolution. ASIAN Shan-Hwei Nienhuys-Cheng, Ronald de Wolf