| 2021 | STOC | Continuous LWE. | Joan Bruna, Oded Regev, Min Jae Song, Yi Tang |
| 2020 | FOCS | Polynomial Data Structure Lower Bounds in the Group Model. | Alexander Golovnev, Gleb Posobin, Oded Regev, Omri Weinstein |
| 2017 | FOCS | On Learning Mixtures of Well-Separated Gaussians. | Oded Regev, Aravindan Vijayaraghavan |
| 2017 | STOC | A reverse Minkowski theorem. | Oded Regev, Noah Stephens-Davidowitz |
| 2017 | STOC | Pseudorandomness of ring-LWE for any ring and modulus. | Chris Peikert, Oded Regev, Noah Stephens-Davidowitz |
| 2016 | EuroCrypt | Recovering Short Generators of Principal Ideals in Cyclotomic Rings. | Ronald Cramer, Lo Ducas, Chris Peikert, Oded Regev |
| 2016 | FOCS | Towards Strong Reverse Minkowski-Type Inequalities for Lattices. | Daniel Dadush, Oded Regev |
| 2016 | SODA | Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing. | Andris Ambainis, Aleksandrs Belovs, Oded Regev, Ronald de Wolf |
| 2016 | SODA | The Restricted Isometry Property of Subsampled Fourier Matrices. | Ishay Haviv, Oded Regev |
| 2015 | FOCS | Tight Hardness of the Non-commutative Grothendieck Problem. | Jop Brit, Oded Regev, Rishi Saket |
| 2015 | STOC | Solving the Shortest Vector Problem in 2 | Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz |
| 2014 | SODA | On the Lattice Isomorphism Problem. | Ishay Haviv, Oded Regev |
| 2013 | EuroCrypt | A Toolkit for Ring-LWE Cryptography. | Vadim Lyubashevsky, Chris Peikert, Oded Regev |
| 2013 | STOC | Classical hardness of learning with errors. | Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, Damien Stehl |
| 2013 | STOC | Efficient rounding for the noncommutative grothendieck inequality. | Assaf Naor, Oded Regev, Thomas Vidick |
| 2011 | STOC | An optimal lower bound on the communication complexity of gap-hamming-distance. | Amit Chakrabarti, Oded Regev |
| 2011 | STOC | Quantum one-way communication can be exponentially stronger than classical communication. | Oded Regev, Bo'az Klartag |
| 2010 | EuroCrypt | Lattice Enumeration Using Extreme Pruning. | Nicolas Gama, Phong Q. Nguyen, Oded Regev |
| 2010 | EuroCrypt | On Ideal Lattices and Learning with Errors over Rings. | Vadim Lyubashevsky, Chris Peikert, Oded Regev |
| 2008 | FOCS | Rounding Parallel Repetitions of Unique Games. | Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer |
| 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 | FOCS | Unique Games with Entangled Provers are Easy. | Julia Kempe, Oded Regev, Ben Toner |
| 2008 | ICALP | Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete. | Lior Eldar, Oded Regev |
| 2008 | ICALP | Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. | Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf |
| 2008 | ICALP | Impossibility of a Quantum Speed-Up with a Faulty Oracle. | Oded Regev, Liron Schiff |
| 2007 | FOCS | Simulating Quantum Correlations with Finite Communication. | Oded Regev, Ben Toner |
| 2007 | STOC | Tensor-based hardness of the shortest vector problem to within almost polynomial factors. | Ishay Haviv, Oded Regev |
| 2006 | CRYPTO | Lattice-Based Cryptography. | Oded Regev |
| 2006 | EuroCrypt | Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures. | Phong Q. Nguyen, Oded Regev |
| 2006 | STOC | Conditional hardness for approximate coloring. | Irit Dinur, Elchanan Mossel, Oded Regev |
| 2006 | STOC | Bounded-error quantum state identification and exponential separations in communication complexity. | Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf |
| 2006 | STOC | Lattice problems and norm embeddings. | Oded Regev, Ricky Rosen |
| 2005 | STOC | On lattices, learning with errors, random linear codes, and cryptography. | Oded Regev |
| 2004 | FOCS | Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. | Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev |
| 2004 | FOCS | Lattice Problems in NP cap coNP. | Dorit Aharonov, Oded Regev |
| 2004 | FOCS | An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching. | Amit Chakrabarti, Oded Regev |
| 2004 | FOCS | Worst-Case to Average-Case Reductions Based on Gaussian Measures. | Daniele Micciancio, Oded Regev |
| 2003 | FOCS | A Lattice Problem in Quantum NP. | Dorit Aharonov, Oded Regev |
| 2003 | STOC | A new multilayered PCP and the hardness of hypergraph vertex cover. | Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev |
| 2003 | STOC | New lattice based cryptographic constructions. | Oded Regev |
| 2002 | FOCS | The Hardness of 3 - Uniform Hypergraph Coloring. | Irit Dinur, Oded Regev, Clifford D. Smyth |
| 2002 | FOCS | Quantum Computation and Lattice Problems. | Oded Regev |
| 2002 | SODA | Temporary tasks assignment resolved. | Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev |
| 2001 | IPCO | Strongly Polynomial Algorithms for the Unsplittable Flow Problem. | Yossi Azar, Oded Regev |
| 1999 | ESA | Off-Line Temporary Tasks Assignment. | Yossi Azar, Oded Regev |
| 1999 | STOC | Minimizing the Flow Time Without Migration. | Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev |
| 1998 | ICDCS | Globally Distributed Computation over the Internet - The POPCORN Project. | Noam Nisan, Shmulik London, Oded Regev, Noam Camiel |