Globally Distributed Computation over the Internet - The POPCORN Project. - Noam Nisan; Shmulik London; Oded Regev 001; Noam Camiel (ICDCS, 1998)

Off-Line Temporary Tasks Assignment. - Yossi Azar; Oded Regev 001 (ESA, 1999)

Maximizing job benefits on-line. - Baruch Awerbuch; Yossi Azar; Oded Regev 001 (APPROX, 2000)

Strongly Polynomial Algorithms for the Unsplittable Flow Problem. - Yossi Azar; Oded Regev 001 (IPCO, 2001)

On-line bin-stretching. - Yossi Azar; Oded Regev 001 (Theor. Comput. Sci., 2001)

Scheduling and load balancing - Oded Regev 001 (2001)

Temporary tasks assignment resolved. - Amitai Armon; Yossi Azar; Leah Epstein; Oded Regev 001 (SODA, 2002)

Priority algorithms for makespan minimization in the subset model. - Oded Regev 001 (Inf. Process. Lett., 2002)

Minimizing the Flow Time Without Migration. - Baruch Awerbuch; Yossi Azar; Stefano Leonardi 001; Oded Regev 001 (SIAM J. Comput., 2002)

Off-line temporary tasks assignment. - Yossi Azar; Oded Regev 001; Jirí Sgall; Gerhard J. Woeginger (Theor. Comput. Sci., 2002)

Vertex Cover Might be Hard to Approximate to within 2- varepsilon. - Subhash Khot; Oded Regev 001 (CCC, 2003)

A Lattice Problem in Quantum NP. - Dorit Aharonov; Oded Regev 001 (FOCS, 2003)

An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching - Amit Chakrabarti; Oded Regev 001 (Electron. Colloquium Comput. Complex., 2003)

On-line restricted assignment of temporary tasks with unknown durations. - Amitai Armon; Yossi Azar; Leah Epstein; Oded Regev 001 (Inf. Process. Lett., 2003)

3-local Hamiltonian is QMA-complete. - Julia Kempe; Oded Regev 001 (Quantum Inf. Comput., 2003)

The Complexity of the Covering Radius Problem on Lattices and Codes. - Venkatesan Guruswami; Daniele Micciancio; Oded Regev 001 (CCC, 2004)

Long Monotone Paths in Line Arrangements. - József Balogh; Oded Regev 001; Clifford D. Smyth; William L. Steiger; Mario Szegedy (Discret. Comput. Geom., 2004)

New lattice-based cryptographic constructions. - Oded Regev 001 (J. ACM, 2004)

Quantum Computation and Lattice Problems. - Oded Regev 001 (SIAM J. Comput., 2004)

Improved Inapproximability of Lattice and Coding Problems With Preprocessing. - Oded Regev 001 (IEEE Trans. Inf. Theory, 2004)

The complexity of the covering radius problem. - Venkatesan Guruswami; Daniele Micciancio; Oded Regev 001 (Comput. Complex., 2005)

The Hardness of 3-Uniform Hypergraph Coloring. - Irit Dinur; Oded Regev 001; Clifford D. Smyth (Comb., 2005)

Lattice problems in NP cap coNP. - Dorit Aharonov; Oded Regev 001 (J. ACM, 2005)

A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. - Irit Dinur; Venkatesan Guruswami; Subhash Khot; Oded Regev 001 (SIAM J. Comput., 2005)

Lattice-Based Cryptography. - Oded Regev 001 (CRYPTO, 2006)

Lattice problems and norm embeddings. - Oded Regev 001; Ricky Rosen (STOC, 2006)

Combinatorial Algorithms for the Unsplittable Flow Problem. - Yossi Azar; Oded Regev 001 (Algorithmica, 2006)

The Complexity of the Local Hamiltonian Problem. - Julia Kempe; Alexei Y. Kitaev; Oded Regev 001 (SIAM J. Comput., 2006)

The Unique Games Conjecture with Entangled Provers is False. - Julia Kempe; Oded Regev 001; Ben Toner (Algebraic Methods in Computational Complexity, 2007)

Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. - Dorit Aharonov; Wim van Dam; Julia Kempe; Zeph Landau; Seth Lloyd; Oded Regev 001 (SIAM J. Comput., 2007)

Worst-Case to Average-Case Reductions Based on Gaussian Measures. - Daniele Micciancio; Oded Regev 001 (SIAM J. Comput., 2007)

On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. - Ishay Haviv; Oded Regev 001; Amnon Ta-Shma (Theory Comput., 2007)

Rounding Parallel Repetitions of Unique Games. - Boaz Barak; Moritz Hardt; Ishay Haviv; Anup Rao 001; Oded Regev 001; David Steurer (FOCS, 2008)

A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs. - Avraham Ben-Aroya; Oded Regev 001; Ronald de Wolf (FOCS, 2008)

Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete. - Lior Eldar; Oded Regev 001 (ICALP (1), 2008)

Impossibility of a Quantum Speed-Up with a Faulty Oracle. - Oded Regev 001; Liron Schiff (ICALP (1), 2008)

Simultaneous Communication Protocols with Quantum and Classical Messages. - Dmitry Gavinsky; Oded Regev 001; Ronald de Wolf (Chic. J. Theor. Comput. Sci., 2008)

Vertex cover might be hard to approximate to within 2-epsilon. - Subhash Khot; Oded Regev 001 (J. Comput. Syst. Sci., 2008)

A Note on the Distribution of the Distance from a Lattice. - Ishay Haviv; Vadim Lyubashevsky; Oded Regev 001 (Discret. Comput. Geom., 2009)

On lattices, learning with errors, random linear codes, and cryptography. - Oded Regev 001 (J. ACM, 2009)

Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures. - Phong Q. Nguyen; Oded Regev 001 (J. Cryptol., 2009)

Conditional Hardness for Approximate Coloring. - Irit Dinur; Elchanan Mossel; Oded Regev 001 (SIAM J. Comput., 2009)

Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity. - Dmitry Gavinsky; Julia Kempe; Oded Regev 001; Ronald de Wolf (SIAM J. Comput., 2009)

Simulating Quantum Correlations with Finite Communication. - Oded Regev 001; Ben Toner (SIAM J. Comput., 2009)

Learning with Errors over Rings. - Oded Regev 001 (ANTS, 2010)

Better Gap-Hamming Lower Bounds via Better Round Elimination. - Joshua Brody; Amit Chakrabarti; Oded Regev 001; Thomas Vidick; Ronald de Wolf (APPROX-RANDOM, 2010)

The Euclidean Distortion of Flat Tori. - Ishay Haviv; Oded Regev 001 (APPROX-RANDOM, 2010)

No Strong Parallel Repetition with Entangled and Non-signaling Provers. - Julia Kempe; Oded Regev 001 (CCC, 2010)

The Learning with Errors Problem (Invited Survey). - Oded Regev 001 (CCC, 2010)

Lattice Enumeration Using Extreme Pruning. - Nicolas Gama; Phong Q. Nguyen; Oded Regev 001 (EUROCRYPT, 2010)

Quantum One-Way Communication is Exponentially Stronger Than Classical Communication. - Bo'az Klartag; Oded Regev 001 (Electron. Colloquium Comput. Complex., 2010)

Upper bounds on the noise threshold for fault-tolerant quantum computing. - Julia Kempe; Oded Regev 001; Falk Unger; Ronald de Wolf (Quantum Inf. Comput., 2010)

An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching. - Amit Chakrabarti; Oded Regev 001 (SIAM J. Comput., 2010)

Unique Games with Entangled Provers Are Easy. - Julia Kempe; Oded Regev 001; Ben Toner (SIAM J. Comput., 2010)

On the Complexity of Lattice Problems with Polynomial Approximation Factors. - Oded Regev 001 (The LLL Algorithm, 2010)

Quantum one-way communication can be exponentially stronger than classical communication. - Oded Regev 001; Bo'az Klartag (STOC, 2011)

Hardness of the Covering Radius Problem on Lattices. - Ishay Haviv; Oded Regev 001 (Chic. J. Theor. Comput. Sci., 2012)

Locally decodable codes and the failure of cotype for projective tensor products - Jop Briët; Assaf Naor; Oded Regev 001 (CoRR, 2012)

Bell violations through independent bases games. - Oded Regev 001 (Quantum Inf. Comput., 2012)

An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance. - Amit Chakrabarti; Oded Regev 001 (SIAM J. Comput., 2012)

Near-Optimal and Explicit Bell Inequality Violations. - Harry Buhrman; Oded Regev 001; Giannicola Scarpa; Ronald de Wolf (Theory Comput., 2012)

Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors. - Ishay Haviv; Oded Regev 001 (Theory Comput., 2012)

Classical hardness of learning with errors. - Zvika Brakerski; Adeline Langlois; Chris Peikert; Oded Regev 001; Damien Stehlé (STOC, 2013)

A Toolkit for Ring-LWE Cryptography. - Vadim Lyubashevsky; Chris Peikert; Oded Regev 001 (IACR Cryptol. ePrint Arch., 2013)

On Ideal Lattices and Learning with Errors over Rings. - Vadim Lyubashevsky; Chris Peikert; Oded Regev 001 (J. ACM, 2013)

On the Closest Vector Problem with a Distance Guarantee. - Daniel Dadush; Oded Regev 001; Noah Stephens-Davidowitz (CCC, 2014)

On the Lattice Isomorphism Problem. - Ishay Haviv; Oded Regev 001 (SODA, 2014)

Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling. - Divesh Aggarwal; Daniel Dadush; Oded Regev 001; Noah Stephens-Davidowitz (CoRR, 2014)

Tight Hardness of the Non-commutative Grothendieck Problem. - Jop Briët; Oded Regev 001 (CoRR, 2014)

Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121). - Anna Gál; Michal Koucký 001; Oded Regev 001; Rüdiger Reischuk (Dagstuhl Reports, 2014)

Efficient Rounding for the Noncommutative Grothendieck Inequality. - Assaf Naor; Oded Regev 001; Thomas Vidick (Theory Comput., 2014)

Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract. - Divesh Aggarwal; Daniel Dadush; Oded Regev 001; Noah Stephens-Davidowitz (STOC, 2015)

Beating the random assignment on constraint satisfaction problems of bounded degree. - Boaz Barak; Ankur Moitra; Ryan O'Donnell; Prasad Raghavendra; Oded Regev 001; David Steurer; Luca Trevisan 001; Aravindan Vijayaraghavan; David Witmer; John Wright 004 (Electron. Colloquium Comput. Complex., 2015)

Recovering Short Generators of Principal Ideals in Cyclotomic Rings. - Ronald Cramer; Léo Ducas; Chris Peikert; Oded Regev 001 (IACR Cryptol. ePrint Arch., 2015)

Quantum XOR Games. - Oded Regev 001; Thomas Vidick (ACM Trans. Comput. Theory, 2015)

Towards Strong Reverse Minkowski-Type Inequalities for Lattices. - Daniel Dadush; Oded Regev 001 (FOCS, 2016)

On the Space Complexity of Linear Programming with Preprocessing. - Yael Tauman Kalai; Ran Raz; Oded Regev 001 (ITCS, 2016)

Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing. - Andris Ambainis; Aleksandrs Belovs; Oded Regev 001; Ronald de Wolf (SODA, 2016)

The Restricted Isometry Property of Subsampled Fourier Matrices. - Ishay Haviv; Oded Regev 001 (SODA, 2016)

A Note on Discrete Gaussian Combinations of Lattice Vectors. - Divesh Aggarwal; Oded Regev 001 (Chic. J. Theor. Comput. Sci., 2016)

The Minrank of Random Graphs. - Alexander Golovnev; Oded Regev 001; Omri Weinstein (Electron. Colloquium Comput. Complex., 2016)

The List-Decoding Size of Fourier-Sparse Boolean Functions. - Ishay Haviv; Oded Regev 001 (ACM Trans. Comput. Theory, 2016)

On Learning Mixtures of Well-Separated Gaussians. - Oded Regev 001; Aravindan Vijayaraghavan (FOCS, 2017)

A reverse Minkowski theorem. - Oded Regev 001; Noah Stephens-Davidowitz (STOC, 2017)

A Sharp Tail Bound for the Expander Random Sampler. - Shravas Rao; Oded Regev 001 (CoRR, 2017)

Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121). - Anna Gál; Michal Koucký 001; Oded Regev 001; Till Tantau (Dagstuhl Reports, 2017)

Pseudorandomness of Ring-LWE for Any Ring and Modulus. - Chris Peikert; Oded Regev 001; Noah Stephens-Davidowitz (IACR Cryptol. ePrint Arch., 2017)

An Inequality for Gaussians on Lattices. - Oded Regev 001; Noah Stephens-Davidowitz (SIAM J. Discret. Math., 2017)

Tight Hardness of the Non-Commutative Grothendieck Problem. - Jop Briët; Oded Regev 001; Rishi Saket (Theory Comput., 2017)

Nearly Optimal Embeddings of Flat Tori. - Ishan Agarwal; Oded Regev 001; Yi Tang (APPROX-RANDOM, 2020)

New bounds on the density of lattice coverings. - Or Ordentlich; Oded Regev 001; Barak Weiss (CoRR, 2020)

Continuous LWE. - Joan Bruna; Oded Regev 001; Min Jae Song; Yi Tang (Electron. Colloquium Comput. Complex., 2020)

On the Gaussian surface area of spectrahedra. - Srinivasan Arunachalam; Oded Regev 001; Penghui Yao (Electron. Colloquium Comput. Complex., 2021)

Bounds on the density of smooth lattice coverings. - Or Ordentlich; Oded Regev 001; Barak Weiss (CoRR, 2023)

Polynomial Data Structure Lower Bounds in the Group Model. - Alexander Golovnev; Gleb Posobin; Oded Regev 001; Omri Weinstein (SIAM J. Comput., 2024)

An Efficient Quantum Factoring Algorithm. - Oded Regev 001 (J. ACM, 2025)