2026 Oded Regev: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	54	4437	4312	2075	2001	136	23801

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Computer Science

4437

4312

2075

2001

136

23801

Overview

Oded Regev is affiliated with the Courant Institute of Mathematical Sciences in the United States. Their research spans multiple disciplines including Mathematics, Biochemistry, Genetics and Molecular Biology, and Computer Science. They have contributed to subfields such as Molecular Biology, Applied Mathematics, Artificial Intelligence, Mathematical Physics, and Geometry and Topology.

The main topics of their scholarly work include:

RNA Research and Splicing
Point processes and geometric inequalities
RNA and protein synthesis mechanisms
Mathematical Dynamics and Fractals
RNA modifications and cancer
Cryptography and Data Security
Limits and Structures in Graph Theory

Regev has published extensively across various venues. The most frequent publication outlets consist of:

arXiv (Cornell University)
bioRxiv (Cold Spring Harbor Laboratory)
Nucleic Acids Research
Science Advances
Journal of the ACM

Their recent papers include the following:

"Splicing at the phase-separated nuclear speckle interface: a model" (2020), published in Nucleic Acids Research
"Dynamics of RNA localization to nuclear speckles are connected to splicing efficiency" (2024), published in Science Advances
"Deciphering RNA splicing logic with interpretable machine learning" (2023), published in Proceedings of the National Academy of Sciences
"An Efficient Quantum Factoring Algorithm" (2024), published in Journal of the ACM
"RNA molecules display distinctive organization at nuclear speckles" (2024), published in iScience

Frequent co-authors who have contributed to research alongside Regev include:

Sneha Paul
Jingyi Fei
Susan E. Liao
Li Wen
Noah Stephens-Davidowitz

Best Publications

On lattices, learning with errors, random linear codes, and cryptography

Oded Regev

7387
Citations
On Ideal Lattices and Learning with Errors over Rings

Vadim Lyubashevsky;Chris Peikert;Oded Regev

2456
Citations
Worst-Case to Average-Case Reductions Based on Gaussian Measures

Daniele Micciancio;Oded Regev

1651
Citations
Vertex cover might be hard to approximate to within 2-ε

Subhash Khot;Oded Regev

937
Citations
Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation

Dorit Aharonov;Wim van Dam;Julia Kempe;Zeph Landau

906
Citations
The Complexity of the Local Hamiltonian Problem

Julia Kempe;Alexei Kitaev;Oded Regev

795
Citations
Classical hardness of learning with errors

Zvika Brakerski;Adeline Langlois;Chris Peikert;Oded Regev

779
Citations
A Toolkit for Ring-LWE Cryptography.

Vadim Lyubashevsky;Chris Peikert;Oded Regev

531
Citations
Lattice-based cryptography

Oded Regev

495
Citations
New lattice-based cryptographic constructions

Oded Regev

403
Citations
Lattice enumeration using extreme pruning

Nicolas Gama;Phong Q. Nguyen;Oded Regev

376
Citations
The Learning with Errors Problem (Invited Survey)

Oded Regev

350
Citations
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures

Phong Q. Nguyen;Oded Regev

297
Citations
Lattice problems in NP ∩ coNP

Dorit Aharonov;Oded Regev

281
Citations
Quantum Computation and Lattice Problems

Oded Regev

269
Citations
Globally distributed computation over the Internet-the POPCORN project

N. Nisan;S. London;O. Regev;N. Camiel

259
Citations
Pseudorandomness of ring-LWE for any ring and modulus

Chris Peikert;Oded Regev;Noah Stephens-Davidowitz

241
Citations
Adiabatic quantum computation is equivalent to standard quantum computation

D. Aharonov;W. van Dam;J. Kempe;Z. Landau

237
Citations
Recovering Short Generators of Principal Ideals in Cyclotomic Rings

Ronald Cramer;Léo Ducas;Chris Peikert;Oded Regev

215
Citations
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover

Irit Dinur;Venkatesan Guruswami;Subhash Khot;Oded Regev

201
Citations
Vertex cover might be hard to approximate to within 2-/spl epsiv/

S. Khot;O. Regev

115
Citations

Frequent Co-Authors

Julia Kempe New York University

Thomas Vidick California Institute of Technology

Chris Peikert University of Michigan–Ann Arbor

Ronald de Wolf University of Amsterdam

Irit Dinur Weizmann Institute of Science

Yossi Azar Tel Aviv University

Assaf Naor Princeton University

Vadim Lyubashevsky IBM (Switzerland)

Dorit Aharonov Hebrew University of Jerusalem

Daniele Micciancio University of California, San Diego

External Links

Wikipedia of Oded Regev Personal website of Oded Regev Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

As the tech industry evolves, students exploring Computer Science in the USA may also consider other valuable fields of study to future-proof their careers. Evaluating the best college degrees for the future can help you identify in-demand programs and adapt to market needs, whether you're interested in software development, data science, or cybersecurity.

For those looking to enhance their credentials with minimal barriers, exploring the easiest masters programs to get into provides options that balance accessibility and career growth. Online learning also makes advanced study more flexible and affordable.

If you’re pursuing research or academia, finding the cheapest online phd can be a smart financial decision. Similarly, fast-track education leadership is possible with the cheapest ed.d online program. These pathways offer both cost-effective and accelerated routes to advanced qualifications—broadening your career options in tech, academia, or organizational leadership.