O. Regev

Most-cited papers

On Ideal Lattices and Learning with Errors over Rings
V. Lyubashevsky, Chris Peikert, O. Regev
2010JACM2,997 citations Open access
Semantic Scholar
On lattices, learning with errors, random linear codes, and cryptography
O. Regev
2009JACM1,372 citations
Semantic Scholar
Classical hardness of learning with errors
Zvika Brakerski, Adeline Langlois, Chris Peikert, O. Regev +1 more
2013Symposium on the Theory of Computing759 citations
Semantic Scholar
A Toolkit for Ring-LWE Cryptography
V. Lyubashevsky, Chris Peikert, O. Regev
2013IACR Cryptology ePrint Archive507 citations Open access
Semantic Scholar
Lattice Enumeration Using Extreme Pruning
Nicolas Gama, P. Nguyen, O. Regev
2010International Conference on the Theory and Application of Cryptographic Techniques317 citations Open access
Semantic Scholar
The Learning with Errors Problem (Invited Survey)
O. Regev
20102010 IEEE 25th Annual Conference on Computational Complexity264 citations
Semantic Scholar
Recovering Short Generators of Principal Ideals in Cyclotomic Rings
R. Cramer, L. Ducas, Chris Peikert, O. Regev
2016International Conference on the Theory and Application of Cryptographic Techniques227 citations Open access
Semantic Scholar
An optimal lower bound on the communication complexity of gap-hamming-distance
Amit Chakrabarti, O. Regev
2010SIAM journal on computing (Print)190 citations Open access
Semantic Scholar
The Restricted Isometry Property of Subsampled Fourier Matrices
I. Haviv, O. Regev
2015ACM-SIAM Symposium on Discrete Algorithms138 citations Open access
Semantic Scholar
Quantum one-way communication can be exponentially stronger than classical communication
O. Regev, B. Klartag
2011Symposium on the Theory of Computing99 citations
Semantic Scholar
An Efficient Quantum Factoring Algorithm
O. Regev
2023Journal of the ACM88 citations Open access
Semantic Scholar
Splicing at the phase-separated nuclear speckle interface: a model
Susan E. Liao, O. Regev
2020Nucleic Acids Research82 citations Open access
Semantic Scholar
Near-Optimal and Explicit Bell Inequality Violations
H. Buhrman, O. Regev, G. Scarpa, R. de Wolf
20102011 IEEE 26th Annual Conference on Computational Complexity81 citations Open access
Semantic Scholar
On Learning Mixtures of Well-Separated Gaussians
O. Regev, Aravindan Vijayaraghavan
2017IEEE Annual Symposium on Foundations of Computer Science80 citations Open access
Semantic Scholar
Beating the random assignment on constraint satisfaction problems of bounded degree
B. Barak, Ankur Moitra, R. O'Donnell, P. Raghavendra +6 more
2015Electron. Colloquium Comput. Complex.72 citations
Semantic Scholar
Impossibility of a Quantum Speed-Up with a Faulty Oracle
O. Regev, Liron Schiff
2008International Colloquium on Automata, Languages and Programming71 citations
Semantic Scholar
Quantum XOR Games
O. Regev, T. Vidick
20122013 IEEE Conference on Computational Complexity68 citations Open access
Semantic Scholar
Continuous LWE
Joan Bruna, O. Regev, M. Song, Yi Tang
2020Electron. Colloquium Comput. Complex.66 citations
Semantic Scholar
On the Lattice Isomorphism Problem
I. Haviv, O. Regev
2013ACM-SIAM Symposium on Discrete Algorithms62 citations
Semantic Scholar
Efficient rounding for the noncommutative grothendieck inequality
A. Naor, O. Regev, T. Vidick
2012Symposium on the Theory of Computing59 citations Open access
Semantic Scholar
Rounding Parallel Repetitions of Unique Games
B. Barak, Moritz Hardt, I. Haviv, Anup Rao +2 more
20082008 49th Annual IEEE Symposium on Foundations of Computer Science57 citations
Semantic Scholar
On the Complexity of Lattice Problems with Polynomial Approximation Factors
O. Regev
2010The LLL Algorithm54 citations
Semantic Scholar
On the Closest Vector Problem with a Distance Guarantee
D. Dadush, O. Regev, N. Stephens-Davidowitz
2014Cybersecurity and Cyberforensics Conference53 citations Open access
Semantic Scholar
Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing
A. Ambainis, Aleksandrs Belovs, O. Regev, R. de Wolf
2015ACM-SIAM Symposium on Discrete Algorithms52 citations
Semantic Scholar
A recurrent COL6A1 pseudoexon insertion causes muscular dystrophy and is effectively targeted by splice-correction therapies.
V. Bolduc, A. Foley, Herimela Solomon-Degefa, A. Sarathy +30 more
2019JCI Insight48 citations Open access
Semantic Scholar
A reverse Minkowski theorem
O. Regev, Noah Stephens-Davidowitz
2016Symposium on the Theory of Computing47 citations Open access
Semantic Scholar
Tight Hardness of the Non-commutative Grothendieck Problem
Jop Briot, O. Regev, Rishi Saket
2014IEEE Annual Symposium on Foundations of Computer Science33 citations Open access
Semantic Scholar
No Strong Parallel Repetition with Entangled and Non-signaling Provers
J. Kempe, O. Regev
20092010 IEEE 25th Annual Conference on Computational Complexity33 citations Open access
Semantic Scholar
Upper bounds on the noise threshold for fault-tolerant quantum computing
J. Kempe, O. Regev, F. Unger, R. de Wolf
2008Quantum information & computation33 citations Open access
Semantic Scholar
Bell violations through independent bases games
O. Regev
2011Quantum information & computation31 citations Open access
Semantic Scholar
A counterexample to a strong variant of the Polynomial Freiman-Ruzsa conjecture in Euclidean space
Shachar Lovett, O. Regev
201630 citations Open access
Semantic Scholar
New bounds on the density of lattice coverings
Or Ordentlich, O. Regev, Barak Weiss
2020Journal of The American Mathematical Society28 citations Open access
Semantic Scholar
The Minrank of Random Graphs
Alexander Golovnev, O. Regev, Omri Weinstein
2016IEEE Transactions on Information Theory28 citations Open access
Semantic Scholar
An Inequality for Gaussians on Lattices
O. Regev, N. Stephens-Davidowitz
2015SIAM Journal on Discrete Mathematics28 citations Open access
Semantic Scholar
A Note on Discrete Gaussian Combinations of Lattice Vectors
Divesh Aggarwal, O. Regev
2013Chicago journal of theoretical computer science28 citations
Semantic Scholar
Towards Strong Reverse Minkowski-Type Inequalities for Lattices
D. Dadush, O. Regev
2016IEEE Annual Symposium on Foundations of Computer Science23 citations Open access
Semantic Scholar
Entropy-based bounds on dimension reduction in L1
O. Regev
201123 citations Open access
Semantic Scholar
Better Gap-Hamming Lower Bounds via Better Round Elimination
J. Brody, Amit Chakrabarti, O. Regev, T. Vidick +1 more
2009International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques23 citations Open access
Semantic Scholar
Deciphering RNA splicing logic with interpretable machine learning
Susan E. Liao, Mukund Sudarshan, O. Regev
2023Proceedings of the National Academy of Sciences of the United States of America21 citations Open access
Semantic Scholar
Kneser graphs are like Swiss cheese
Ehud Friedgut, O. Regev
201720 citations Open access
Semantic Scholar
Modern Fluid Dynamics for Physics and Astrophysics
O. Regev, O. Umurhan, P. Yecko
201620 citations
Semantic Scholar
Quantum One-Way Communication is Exponentially Stronger Than Classical Communication
B. Klartag, O. Regev
2010Electron. Colloquium Comput. Complex.19 citations
Semantic Scholar
Krivine schemes are optimal
A. Naor, O. Regev
201218 citations Open access
Semantic Scholar
Locally decodable codes and the failure of cotype for projective tensor products
J. Briët, A. Naor, O. Regev
2012arXiv.org17 citations Open access
Semantic Scholar
A Note on the Distribution of the Distance from a Lattice
I. Haviv, V. Lyubashevsky, O. Regev
2009Discrete & Computational Geometry17 citations Open access
Semantic Scholar
Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete
Lior Eldar, O. Regev
2008International Colloquium on Automata, Languages and Programming17 citations
Semantic Scholar
A Sharp Tail Bound for the Expander Random Sampler
Shravas Rao, O. Regev
2017arXiv.org16 citations
Semantic Scholar
Elementary Proofs of Grothendieck Theorems for Completely Bounded Norms
O. Regev, T. Vidick
201216 citations Open access
Semantic Scholar
Global transient dynamics of three-dimensional hydrodynamical disturbances in a thin viscous accretion disk
P. Rebusco, O. Umurhan, W. Kluźniak, O. Regev
200916 citations Open access
Semantic Scholar
Simultaneous Communication Protocols with Quantum and Classical Messages
Dmitry Gavinsky, O. Regev, R. de Wolf
2008Chicago journal of theoretical computer science15 citations
Semantic Scholar