| 2026 | CRYPTO | An Improved Quantum Algorithm for 3-Tuple Lattice Sieving. | Lynn Engelberts, Yanlin Chen, Amin Shiraz Gilani, Maya-Iggy van Hoof, Stacey Jeffery, Ronald de Wolf |
| 2025 | SODA | A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix. | Yanlin Chen, Andrs Gilyn, Ronald de Wolf |
| 2023 | ESA | Improved Quantum Boosting. | Adam Izdebski, Ronald de Wolf |
| 2023 | ESA | Tight Bounds for Quantum Phase Estimation and Related Problems. | Nikhil S. Mande, Ronald de Wolf |
| 2023 | ICALP | Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints. | Yanlin Chen, Ronald de Wolf |
| 2022 | STACS | Symmetry and Quantum Query-To-Communication Simulation. | Sourav Chakraborty, Arkadev Chattopadhyay, Peter Hyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf |
| 2021 | ICALP | Quantum Algorithms for Matrix Scaling and Matrix Balancing. | Joran van Apeldoorn, Sander Gribling, Yinan Li, Harold Nieuwboer, Michael Walter, Ronald de Wolf |
| 2020 | FOCS | Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving. | Simon Apers, Ronald de Wolf |
| 2020 | STACS | Improved Bounds on Fourier Entropy and Min-Entropy. | Srinivasan Arunachalam, Sourav Chakraborty, Michal Kouck, Nitin Saurabh, Ronald de Wolf |
| 2019 | FOCS | Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. | Makrand Sinha, Ronald de Wolf |
| 2019 | ICALP | Two New Results About Quantum Exact Learning. | Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, Ronald de Wolf |
| 2018 | PQCrypto | Attacks on the AJPS Mersenne-Based Cryptosystem. | Koen de Boer, Lo Ducas, Stacey Jeffery, Ronald de Wolf |
| 2017 | FOCS | Quantum SDP-Solvers: Better Upper and Lower Bounds. | Joran van Apeldoorn, Andrs Gilyn, Sander Gribling, Ronald de Wolf |
| 2016 | SODA | Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing. | Andris Ambainis, Aleksandrs Belovs, Oded Regev, Ronald de Wolf |
| 2015 | ICALP | Query Complexity in Expectation. | Jedrzej Kaniewski, Troy Lee, Ronald de Wolf |
| 2014 | ESA | Optimal Parallel Quantum Query Algorithms. | Stacey Jeffery, Frdric Magniez, Ronald de Wolf |
| 2013 | STACS | Optimal quantum query bounds for almost all Boolean functions. | Andris Ambainis, Arturs Backurs, Juris Smotrovs, Ronald de Wolf |
| 2013 | STACS | Fooling One-Sided Quantum Protocols. | Hartmut Klauck, Ronald de Wolf |
| 2012 | STOC | Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. | Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf |
| 2010 | STACS | Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation. | Victor Chen, Elena Grigorescu, Ronald de Wolf |
| 2009 | STACS | Locally Decodable Quantum Codes. | Jop Brit, Ronald de Wolf |
| 2009 | STACS | Error-Correcting Data Structures. | Ronald de Wolf |
| 2008 | FOCS | A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs. | Avraham Ben-Aroya, Oded Regev, Ronald de Wolf |
| 2008 | ICALP | Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. | Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf |
| 2007 | STOC | Exponential separations for one-way quantum communication complexity, with applications to cryptography. | Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf |
| 2006 | ICALP | Lower Bounds on Matrix Rigidity Via a Quantum Argument. | Ronald de Wolf |
| 2006 | STOC | A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs. | Andris Ambainis, Robert Spalek, Ronald de Wolf |
| 2006 | STOC | Bounded-error quantum state identification and exponential separations in communication complexity. | Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf |
| 2005 | ICALP | Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval. | Stephanie Wehner, Ronald de Wolf |
| 2005 | STACS | Robust Polynomials and Quantum Algorithms. | Harry Buhrman, Ilan Newman, Hein Rhrig, Ronald de Wolf |
| 2004 | FOCS | Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. | Hartmut Klauck, Robert Spalek, Ronald de Wolf |
| 2003 | ICALP | Quantum Search on Bounded-Error Inputs. | Peter Hyer, Michele Mosca, Ronald de Wolf |
| 2003 | STOC | Exponential lower bound for 2-query locally decodable codes via a quantum argument. | Iordanis Kerenidis, Ronald de Wolf |
| 2002 | STACS | On Quantum Versions of the Yao Principle. | Mart de Graaf, Ronald de Wolf |
| 2002 | STACS | Improved Quantum Communication Complexity Bounds for Disjointness and Equality. | Peter Hyer, Ronald de Wolf |
| 2000 | FOCS | Private Quantum Channels. | Andris Ambainis, Michele Mosca, Alain Tapp, Ronald de Wolf |
| 2000 | STACS | Average-Case Quantum Query Complexity. | Andris Ambainis, Ronald de Wolf |
| 1999 | FOCS | Bounds for Small-Error and Zero-Error Quantum Algorithms. | Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka |
| 1999 | STACS | Decidability and Undecidability of Marked PCP. | Vesa Halava, Mika Hirvensalo, Ronald de Wolf |
| 1998 | FOCS | Quantum Lower Bounds by Polynomials. | Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf |
| 1996 | ECAI | A Complete Method for Program Specialization Based on Unfolding. | Shan-Hwei Nienhuys-Cheng, Ronald de Wolf |
| 1996 | ILP | Least Generalizations under Implication. | Shan-Hwei Nienhuys-Cheng, Ronald de Wolf |