default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRonald de Wolf
- > Home > Persons > Ronald de Wolf
Publications
- 2025
[c59]Yanlin Chen, András Gilyén, Ronald de Wolf:
A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix. SODA 2025: 994-1036- [i70]Han-Hsuan Lin, Ronald de Wolf:
Getting almost all the bits from a quantum random access code. CoRR abs/2506.01903 (2025) - 2024
- [j46]Sergey Bravyi, Yash Sharma, Mario Szegedy, Ronald de Wolf:
Generating k EPR-pairs from an n-party resource state. Quantum 8: 1348 (2024) - [i69]Yanlin Chen, András Gilyén, Ronald de Wolf:
A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix. CoRR abs/2405.14765 (2024) - 2023
- [c57]Nikhil S. Mande
, Ronald de Wolf:
Tight Bounds for Quantum Phase Estimation and Related Problems. ESA 2023: 81:1-81:16 - [c56]Olivier Lalonde, Nikhil S. Mande, Ronald de Wolf:
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. FSTTCS 2023: 32:1-32:18 - [c55]Yanlin Chen, Ronald de Wolf:
Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints. ICALP 2023: 38:1-38:21 - [i68]Nikhil S. Mande, Ronald de Wolf:
Tight Bounds for Quantum Phase Estimation and Related Problems. CoRR abs/2305.04908 (2023) - 2022
- [j45]Noah Linden, Ronald de Wolf:
Average-Case Verification of the Quantum Fourier Transform Enables Worst-Case Phase Estimation. Quantum 6: 872 (2022) - [j44]Simon Apers, Ronald de Wolf:
Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving. SIAM J. Comput. 51(6): 1703-1742 (2022) - [c54]Nikhil Bansal, Makrand Sinha, Ronald de Wolf:
Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum Algorithms. CCC 2022: 28:1-28:21 - [c53]Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf:
Symmetry and Quantum Query-To-Communication Simulation. STACS 2022: 20:1-20:23 - [i67]Nikhil Bansal, Makrand Sinha, Ronald de Wolf:
Influence in Completely Bounded Block-multilinear Forms and Classical Simulation of Quantum Algorithms. CoRR abs/2203.00212 (2022) - 2021
- [j43]Noah Linden, Ronald de Wolf:
Lightweight Detection of a Small Number of Large Errors in a Quantum Circuit. Quantum 5: 436 (2021) - [j42]Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, Ronald de Wolf:
Two new results about quantum exact learning. Quantum 5: 587 (2021) - [j41]Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf:
Improved Bounds on Fourier Entropy and Min-entropy. ACM Trans. Comput. Theory 13(4): 22:1-22:40 (2021) - [c52]Joran van Apeldoorn, Sander Gribling, Yinan Li, Harold Nieuwboer, Michael Walter, Ronald de Wolf:
Quantum Algorithms for Matrix Scaling and Matrix Balancing. ICALP 2021: 110:1-110:17 - [i66]Yfke Dulek, Stacey Jeffery, Christian Majenz, Christian Schaffner, Florian Speelman, Ronald de Wolf:
A Guide for New Program Committee Members at Theoretical Computer Science Conferences. CoRR abs/2105.02773 (2021) - [i65]Nikhil S. Mande, Ronald de Wolf:
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. CoRR abs/2107.11806 (2021) - [i64]Yanlin Chen, Ronald de Wolf:
Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints. CoRR abs/2110.13086 (2021) - [i63]Arjan Cornelissen, Nikhil S. Mande, Maris Ozols, Ronald de Wolf:
Exact quantum query complexity of computing Hamming weight modulo powers of two and three. CoRR abs/2112.14682 (2021) - [i62]Nikhil S. Mande, Ronald de Wolf:
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j40]Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf:
Convex optimization using quantum oracles. Quantum 4: 220 (2020) - [j39]Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf:
Quantum SDP-Solvers: Better upper and lower bounds. Quantum 4: 230 (2020) - [c51]Simon Apers, Ronald de Wolf:
Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving. FOCS 2020: 637-648 - [c50]Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf:
Improved Bounds on Fourier Entropy and Min-Entropy. STACS 2020: 45:1-45:19 - [c49]Srinivasan Arunachalam, Aleksandrs Belovs, Andrew M. Childs, Robin Kothari, Ansis Rosmanis, Ronald de Wolf:
Quantum Coupon Collector. TQC 2020: 10:1-10:17 - [i61]Srinivasan Arunachalam, Aleksandrs Belovs, Andrew M. Childs, Robin Kothari, Ansis Rosmanis, Ronald de Wolf:
Quantum Coupon Collector. CoRR abs/2002.07688 (2020) - [i59]Joran van Apeldoorn, Sander Gribling, Yinan Li, Harold Nieuwboer, Michael Walter, Ronald de Wolf:
Quantum algorithms for matrix scaling and matrix balancing. CoRR abs/2011.12823 (2020) - [i58]Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf:
Symmetry and Quantum Query-to-Communication Simulation. CoRR abs/2012.05233 (2020) - 2019
- [c48]Makrand Sinha, Ronald de Wolf:
Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. FOCS 2019: 966-981 - [c47]Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, Ronald de Wolf:
Two New Results About Quantum Exact Learning. ICALP 2019: 16:1-16:15 - [i56]Simon Apers, Ronald de Wolf:
Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving. CoRR abs/1911.07306 (2019) - 2018
- [j38]Srinivasan Arunachalam, Ronald de Wolf:
Optimal Quantum Sample Complexity of Learning Algorithms. J. Mach. Learn. Res. 19: 71:1-71:36 (2018) - [c46]Koen de Boer, Léo Ducas, Stacey Jeffery, Ronald de Wolf:
Attacks on the AJPS Mersenne-Based Cryptosystem. PQCrypto 2018: 101-120 - [i55]Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf:
Convex optimization using quantum oracles. CoRR abs/1809.00643 (2018) - [i54]Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf:
Improved bounds on Fourier entropy and Min-entropy. CoRR abs/1809.09819 (2018) - [i53]Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Ronald de Wolf:
Two new results about quantum exact learning. CoRR abs/1810.00481 (2018) - [i52]Makrand Sinha, Ronald de Wolf:
Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. CoRR abs/1811.10090 (2018) - [i51]Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf:
Improved bounds on Fourier entropy and Min-entropy. Electron. Colloquium Comput. Complex. TR18 (2018) - [i50]Makrand Sinha, Ronald de Wolf:
Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j37]Stacey Jeffery, Frédéric Magniez, Ronald de Wolf:
Optimal Parallel Quantum Query Algorithms. Algorithmica 79(2): 509-529 (2017) - [j35]Troy Lee, Zhaohui Wei, Ronald de Wolf:
Some upper and lower bounds on PSD-rank. Math. Program. 162(1-2): 495-521 (2017) - [j34]Srinivasan Arunachalam, Ronald de Wolf:
Optimizing the number of gates in quantum search. Quantum Inf. Comput. 17(3&4): 251-261 (2017) - [j33]Srinivasan Arunachalam, Ronald de Wolf:
Guest Column: A Survey of Quantum Learning Theory. SIGACT News 48(2): 41-67 (2017) - [c45]Srinivasan Arunachalam, Ronald de Wolf:
Optimal Quantum Sample Complexity of Learning Algorithms. CCC 2017: 25:1-25:31 - [c44]Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf:
Quantum SDP-Solvers: Better Upper and Lower Bounds. FOCS 2017: 403-414 - [i49]Srinivasan Arunachalam, Ronald de Wolf:
A Survey of Quantum Learning Theory. CoRR abs/1701.06806 (2017) - [i48]Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf:
Quantum SDP-Solvers: Better upper and lower bounds. CoRR abs/1705.01843 (2017) - [i46]Koen de Boer, Léo Ducas, Stacey Jeffery, Ronald de Wolf:
Attacks on the AJPS Mersenne-based cryptosystem. IACR Cryptol. ePrint Arch. 2017: 1171 (2017) - 2016
- [j32]Ashley Montanaro, Ronald de Wolf:
A Survey of Quantum Property Testing. Theory Comput. 7: 1-81 (2016) - [c43]Troy Lee, Anupam Prakash, Ronald de Wolf, Henry Yuen:
On the Sum-of-Squares Degree of Symmetric Quadratic Functions. CCC 2016: 17:1-17:31 - [c42]Andris Ambainis, Aleksandrs Belovs, Oded Regev, Ronald de Wolf:
Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing. SODA 2016: 903-922 - [i45]Troy Lee, Anupam Prakash, Ronald de Wolf, Henry Yuen:
On the sum-of-squares degree of symmetric quadratic functions. CoRR abs/1601.02311 (2016) - [i44]Srinivasan Arunachalam, Ronald de Wolf:
Optimal Quantum Sample Complexity of Learning Algorithms. CoRR abs/1607.00932 (2016) - 2015
- [j31]Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf:
Exponential Lower Bounds for Polytopes in Combinatorial Optimization. J. ACM 62(2): 17:1-17:23 (2015) - [j30]Urmila Mahadev, Ronald de Wolf:
Rational approximations and quantum algorithms with postselection. Quantum Inf. Comput. 15(3&4): 295-307 (2015) - [c41]Jedrzej Kaniewski, Troy Lee, Ronald de Wolf:
Query Complexity in Expectation. ICALP (1) 2015: 761-772 - [i43]Andris Ambainis, Aleksandrs Belovs, Oded Regev, Ronald de Wolf:
Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing. CoRR abs/1507.03126 (2015) - [i42]Srinivasan Arunachalam, Ronald de Wolf:
Optimizing the Number of Gates in Quantum Search. CoRR abs/1512.07550 (2015) - 2014
- [j29]Andris Ambainis, Ronald de Wolf:
How Low can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions? Comput. Complex. 23(2): 305-322 (2014) - [c40]Stacey Jeffery, Frédéric Magniez, Ronald de Wolf:
Optimal Parallel Quantum Query Algorithms. ESA 2014: 592-604 - [i41]Urmila Mahadev, Ronald de Wolf:
Rational approximations and quantum algorithms with postselection. CoRR abs/1401.0912 (2014) - [i40]Troy Lee, Zhaohui Wei, Ronald de Wolf:
Some upper and lower bounds on PSD-rank. CoRR abs/1407.4308 (2014) - [i39]Jedrzej Kaniewski, Troy Lee, Ronald de Wolf:
Query complexity in expectation. CoRR abs/1411.7280 (2014) - 2013
- [j28]Harry Buhrman, David García-Soriano, Arie Matsliah, Ronald de Wolf:
The non-adaptive query complexity of testing k-parities. Chic. J. Theor. Comput. Sci. 2013 (2013) - [c39]Andris Ambainis, Ronald de Wolf:
How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions? CCC 2013: 179-184 - [c38]Hartmut Klauck, Ronald de Wolf:
Fooling One-Sided Quantum Protocols. STACS 2013: 424-433 - [c37]Andris Ambainis, Arturs Backurs, Juris Smotrovs, Ronald de Wolf:
Optimal quantum query bounds for almost all Boolean functions. STACS 2013: 446-453 - [i38]Stacey Jeffery, Frédéric Magniez, Ronald de Wolf:
Optimal parallel quantum query algorithms. CoRR abs/1309.6116 (2013) - 2012
- [j26]Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf:
Near-Optimal and Explicit Bell Inequality Violations. Theory Comput. 8(1): 623-645 (2012) - [c36]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. FSTTCS 2012: 148-159 - [c35]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: 95-106 - [i37]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 abs/1204.4596 (2012) - [i36]Hartmut Klauck, Ronald de Wolf:
Fooling One-Sided Quantum Protocols. CoRR abs/1204.4619 (2012) - [i35]Harry Buhrman, David García-Soriano, Arie Matsliah, Ronald de Wolf:
The non-adaptive query complexity of testing k-parities. CoRR abs/1209.3849 (2012) - 2011
- [c34]Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf:
Near-Optimal and Explicit Bell Inequality Violations. CCC 2011: 157-166 - [i34]Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf:
Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds. CoRR abs/1111.0837 (2011) - 2010
- [j23]Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf:
Upper bounds on the noise threshold for fault-tolerant quantum computing. Quantum Inf. Comput. 10(5&6): 361-376 (2010) - [c32]Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf:
Better Gap-Hamming Lower Bounds via Better Round Elimination. APPROX-RANDOM 2010: 476-489 - [c31]Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf:
New Results on Quantum Property Testing. FSTTCS 2010: 145-156 - [i33]Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf:
New Results on Quantum Property Testing. CoRR abs/1005.0523 (2010) - 2009
- [j22]Andris Ambainis, Robert Spalek, Ronald de Wolf:
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs. Algorithmica 55(3): 422-461 (2009) - [j21]Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf:
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity. SIAM J. Comput. 39(1): 1-24 (2009) - [c29]Jop Briët, Ronald de Wolf:
Locally Decodable Quantum Codes. STACS 2009: 219-230 - [i30]Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf:
Better Gap-Hamming Lower Bounds via Better Round Elimination. CoRR abs/0912.5276 (2009) - 2008
- [j20]Dmitry Gavinsky, Oded Regev, Ronald de Wolf:
Simultaneous Communication Protocols with Quantum and Classical Messages. Chic. J. Theor. Comput. Sci. 2008 (2008) - [j18]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. 38(5): 1695-1708 (2008) - [c27]Avraham Ben-Aroya, Oded Regev, Ronald de Wolf:
A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs. FOCS 2008: 477-486 - [c26]Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf:
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. ICALP (1) 2008: 845-856 - 2007
- [j16]Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf:
Robust Polynomials and Quantum Algorithms. Theory Comput. Syst. 40(4): 379-395 (2007) - [j15]Hartmut Klauck, Robert Spalek, Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. SIAM J. Comput. 36(5): 1472-1493 (2007) - [c25]Harry Buhrman, Nikolai K. Vereshchagin, Ronald de Wolf:
On Computation and Communication with Small Bias. CCC 2007: 24-32 - [c24]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: 516-525 - 2006
- [c23]Dmitry Gavinsky, Julia Kempe, Ronald de Wolf:
Strengths and Weaknesses of Quantum Fingerprinting. CCC 2006: 288-298 - [c21]Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf:
Bounded-error quantum state identification and exponential separations in communication complexity. STOC 2006: 594-603 - [c20]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: 618-633 - [i26]Dmitry Gavinsky, Julia Kempe, Ronald de Wolf:
Strengths and Weaknesses of Quantum Fingerprinting. CoRR abs/quant-ph/0603173 (2006) - [i25]Dmitry Gavinsky, Julia Kempe, Ronald de Wolf:
Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function. CoRR abs/quant-ph/0607174 (2006) - [i24]Dmitry Gavinsky, Julia Kempe, Ronald de Wolf:
Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j13]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) - [c19]Stephanie Wehner, Ronald de Wolf:
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval. ICALP 2005: 1424-1436 - [c18]Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf:
Robust Polynomials and Quantum Algorithms. STACS 2005: 593-604 - [i22]Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf:
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity. CoRR abs/quant-ph/0511013 (2005) - [i21]Andris Ambainis, Robert Spalek, Ronald de Wolf:
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs. CoRR abs/quant-ph/0511200 (2005) - 2004
- [j12]Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf:
Algorithmic Clustering of Music Based on String Compression. Comput. Music. J. 28(4): 49-67 (2004) - [j11]Iordanis Kerenidis, Ronald de Wolf:
Quantum symmetrically-private information retrieval. Inf. Process. Lett. 90(3): 109-114 (2004) - [j10]Iordanis Kerenidis, Ronald de Wolf:
Exponential lower bound for 2-query locally decodable codes via a quantum argument. J. Comput. Syst. Sci. 69(3): 395-420 (2004) - [c17]Hartmut Klauck, Robert Spalek, Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. FOCS 2004: 12-21 - [c16]Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf:
Algorithmic Clustering of Music. WEDELMUSIC 2004: 110-117 - [i20]Hartmut Klauck, Robert Spalek, Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. CoRR quant-ph/0402123 (2004) - [i19]Stephanie Wehner, Ronald de Wolf:
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval. CoRR quant-ph/0403140 (2004) - [i18]Dmitry Gavinsky, Julia Kempe, Ronald de Wolf:
Quantum Communication Cannot Simulate a Public Coin. CoRR quant-ph/0411051 (2004) - [i17]Hartmut Klauck, Robert Spalek, Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j9]Harry Buhrman, Ronald de Wolf:
Quantum zero-error algorithms cannot be composed. Inf. Process. Lett. 87(2): 79-84 (2003) - [c15]Peter Høyer, Michele Mosca, Ronald de Wolf:
Quantum Search on Bounded-Error Inputs. ICALP 2003: 291-299 - [c14]Iordanis Kerenidis, Ronald de Wolf:
Exponential lower bound for 2-query locally decodable codes via a quantum argument. STOC 2003: 106-115 - [i16]Rudi Cilibrasi, Paul M. B. Vitányi, Ronald de Wolf:
Algorithmic Clustering of Music. CoRR cs.SD/0303025 (2003) - [i15]Peter Høyer, Michele Mosca, Ronald de Wolf:
Quantum Search on Bounded-Error Inputs. CoRR quant-ph/0304052 (2003) - [i14]Iordanis Kerenidis, Ronald de Wolf:
Quantum Symmetrically-Private Information Retrieval. CoRR quant-ph/0307076 (2003) - [i13]Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf:
Robust Quantum Algorithms and Polynomials. CoRR quant-ph/0309220 (2003) - 2002
- [j5]Harry Buhrman, Ronald de Wolf:
Complexity measures and decision tree complexity: a survey. Theor. Comput. Sci. 288(1): 21-43 (2002) - [c13]Peter Høyer, Ronald de Wolf:
Improved Quantum Communication Complexity Bounds for Disjointness and Equality. STACS 2002: 299-310 - [i12]Iordanis Kerenidis, Ronald de Wolf:
Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument. CoRR quant-ph/0208062 (2002) - [i11]Harry Buhrman, Ronald de Wolf:
Quantum Zero-Error Algorithms Cannot be Composed. CoRR quant-ph/0211029 (2002) - [i10]Iordanis Kerenidis, Ronald de Wolf:
Exponential Lower Bound for 2-Query Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j4]Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf:
Quantum lower bounds by polynomials. J. ACM 48(4): 778-797 (2001) - [c11]Harry Buhrman, Ronald de Wolf:
Communication Complexity Lower Bounds by Polynomials. CCC 2001: 120-130 - [c10]Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf:
Quantum Algorithms for Element Distinctness. CCC 2001: 131-137 - [i9]Peter Høyer, Ronald de Wolf:
Improved Quantum Communication Complexity Bounds for Disjointness and Equality. CoRR quant-ph/0109068 (2001) - 2000
- [c8]Andris Ambainis, Michele Mosca, Alain Tapp, Ronald de Wolf:
Private Quantum Channels. FOCS 2000: 547-553 - [c7]Andris Ambainis, Ronald de Wolf:
Average-Case Quantum Query Complexity. STACS 2000: 133-144 - 1999
- [j2]Harry Buhrman, Ronald de Wolf:
A Lower Bound for Quantum Search of an Ordered List. Inf. Process. Lett. 70(5): 205-209 (1999) - [c6]Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka:
Bounds for Small-Error and Zero-Error Quantum Algorithms. FOCS 1999: 358-368 - [i6]Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka:
Bounds for Small-Error and Zero-Error Quantum Algorithms. CoRR cs.CC/9904019 (1999) - [i5]Harry Buhrman, Ronald de Wolf:
Communication Complexity Lower Bounds by Polynomials. CoRR cs.CC/9910010 (1999) - [i4]Andris Ambainis, Ronald de Wolf:
Average-Case Quantum Query Complexity. CoRR quant-ph/9904079 (1999) - 1998
- [c4]Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf:
Quantum Lower Bounds by Polynomials. FOCS 1998: 352-361 - [i3]Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf:
Quantum Lower Bounds by Polynomials. CoRR quant-ph/9802049 (1998) - [i2]Harry Buhrman, Ronald de Wolf:
Lower Bounds for Quantum Search and Derandomization. CoRR quant-ph/9811046 (1998)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-07-15 20:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
