Oded Regev

19k citations
151 papers · 13k · 9 hit papers · h-index 43

Impact in

    • Cryptography and Data Security
    • Quantum Computing Algorithms and Architecture
    • Quantum Information and Cryptography
    • Cryptographic Implementations and Security
    • Complexity and Algorithms in Graphs
    • Advanced Graph Theory Research

Papers in

Oded Regev

147 papers receiving 12.3k citations

Oded Regev's Hit Papers

On Ideal Lattices and Learning with Errors over Rings 2013 · 608 citations
6080+7+14Years since publication5001k1.5k

Peers

Oded Regev
Comparison fields: 5 of 83
  • Artificial Intelligence 10.1k
  • Computational Theory and Mathematics 1.9k
  • Information Systems 1.4k
  • Discrete Mathematics and Combinatorics 194
  • Computer Networks and Communications 672
Replace Daniele Micciancio with:
Daniele Micciancio United States
Don Coppersmith United States
Shafi Goldwasser United States
Russell Impagliazzo United States
Boaz Barak United States
Umesh V. Vazirani United States
Claus Peter Schnorr Germany
Salil Vadhan United States
Joe Kilian United States
Silvio M. Micali United States
Oded Regev relative to Daniele Micciancio United States Daniele Micciancio's profile →
Citations per field
00.5×1.5×2×2.5×
Daniele Micciancio · 1×
Citations per year

Countries citing papers authored by Oded Regev

Since Specialization
Citations

This map shows the geographic impact of Oded Regev's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Oded Regev with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Oded Regev more than expected).

Fields of papers citing papers by Oded Regev

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Oded Regev. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Oded Regev. The network helps show where Oded Regev may publish in the future.

Co-authors

The 25 scholars most cited alongside Oded Regev, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Oded Regev Line = papers co-authored together Oded Regev links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 151 papers — load more, or switch the sort, to bring in the rest.

#Work
1
On lattices, learning with errors, random linear codes, and cryptography
Hit paper breakdown →
20051663
2
On lattices, learning with errors, random linear codes, and cryptography
Hit paper breakdown →
20091583
3
On Ideal Lattices and Learning with Errors over Rings
Hit paper breakdown →
20101345
4
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Hit paper breakdown →
2007666
5
On Ideal Lattices and Learning with Errors over Rings
Hit paper breakdown →
2013608
6
Lattice-based Cryptography
Hit paper breakdown →
2009481
7
Vertex cover might be hard to approximate to within 2−ε
Hit paper breakdown →
2007458
8
Classical hardness of learning with errors
Hit paper breakdown →
2013455
9
The Complexity of the Local Hamiltonian Problem
Hit paper breakdown →
2006431
10 2006373
11 2007315
12 2013300
13 2008245
14 2004223
15 2010191
16 2004184
17 2010169
18 2005126
19 2017117
20 2004113

About Oded Regev

Oded Regev is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Discrete Mathematics and Combinatorics, Algebra and Number Theory and Mathematical Physics, having authored 151 papers that have together received 13k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (60 papers), Cryptography and Data Security (33 papers), Quantum Computing Algorithms and Architecture (28 papers), Quantum Information and Cryptography (15 papers), Limits and Structures in Graph Theory (10 papers), Analytic Number Theory Research (9 papers), Optimization and Search Problems (7 papers) and RNA Research and Splicing (7 papers). The work is most often cited by research in Artificial Intelligence (10.1k citations), Computational Theory and Mathematics (1.9k citations), Information Systems (1.4k citations), Discrete Mathematics and Combinatorics (194 citations) and Computer Networks and Communications (672 citations). Oded Regev has collaborated with scholars based in United States, Israel and France. Frequent co-authors include Chris Peikert, Vadim Lyubashevsky, Daniele Micciancio, Julia Kempe, Subhash Khot, Dorit Aharonov, Alexei Kitaev, Phong H. Nguyen, Zeph A. Landau and Seth Lloyd. Their work appears in journals such as SIAM Journal on Computing, Theory of Computing, Journal of the ACM, Quantum Information and Computation and Israel Journal of Mathematics.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact