Oded Regev

New York University — United States

Computer Science · Physical Sciences

27h-index2.6kcitations66works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(44), Advanced Graph Theory Research(18), Cryptography and Data Security(14), Computability, Logic, AI Algorithms(14), Computational Geometry and Mesh Generation(10)

Publications66 total

Analysis of RNA localization to nuclear speckles and fitting of splicing kinetic parameters
Zenodo (CERN European Organization for Nuclear Research)·2026Open Access
Analysis of RNA localization to nuclear speckles and fitting of splicing kinetic parameters
Zenodo (CERN European Organization for Nuclear Research)·2026Open Access
Untitled
Theory of Computing·2017· 10 citedOpen Access
Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121)
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2017Open Access
Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2015· 27 citedOpen Access
Tight Hardness of the Non-commutative Grothendieck Problem
arXiv (Cornell University)·2014· 2 citedOpen Access
Elementary proofs of Grothendieck theorems for completely bounded norms
Journal of Operator Theory·2014· 15 cited
Untitled
Theory of Computing·2014· 6 citedOpen Access
Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121)
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2014Open Access
On the Lattice Isomorphism Problem
arXiv (Cornell University)·2013Open Access
Efficient Rounding for the Noncommutative Grothendieck Inequality
arXiv (Cornell University)·2012· 1 citedOpen Access
Quantum XOR Games
arXiv (Cornell University)·2012Open Access
Elementary Proofs of Grothendieck Theorems for Completely Bounded Norms
arXiv (Cornell University)·2012· 4 citedOpen Access
Untitled
Theory of Computing·2012· 45 citedOpen Access
Untitled
Chicago Journal of Theoretical Computer Science·2012· 2 citedOpen Access
Hardness of the Covering Radius Problem on Lattices.
2012· 9 cited
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
SIAM Journal on Computing·2012· 86 cited
Entropy-based Bounds on Dimension Reduction in L_1
arXiv (Cornell University)·2011· 6 citedOpen Access
An optimal lower bound on the communication complexity of gap-hamming-distance
2011· 69 cited
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
arXiv (Cornell University)·2010Open Access
page 1 of 4Next →

Frequent Co-authors

Irit Dinur(8), Julia Kempe(7), Ishay Haviv(7), Subhash Khot(5), Elchanan Mossel(5), Thomas Vidick(5), Venkatesan Guruswami(4), Ben Toner(4), Ryan O’Donnell(3), Ronald de Wolf(3), Amit Chakrabarti(3), Jeffrey E. Steif(2), Benny Sudakov(2), Yossi Azar(2), Boaz Barak(2), David Steurer(2), Jop Briët(2), Rishi Saket(2), Assaf Naor(2), Avraham Ben-Aroya(1)