Oded Regev

2.6k total citations
31 papers, 992 citations indexed

About

Oded Regev is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Oded Regev has authored 31 papers receiving a total of 992 indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Computational Theory and Mathematics, 11 papers in Artificial Intelligence and 7 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Oded Regev's work include Complexity and Algorithms in Graphs (25 papers), Advanced Graph Theory Research (12 papers) and Cryptography and Data Security (8 papers). Oded Regev is often cited by papers focused on Complexity and Algorithms in Graphs (25 papers), Advanced Graph Theory Research (12 papers) and Cryptography and Data Security (8 papers). Oded Regev collaborates with scholars based in United States, Israel and United Kingdom. Oded Regev's co-authors include Subhash Khot, Irit Dinur, Elchanan Mossel, Venkatesan Guruswami, Julia Kempe, Ishay Haviv, Ben Toner, Amit Chakrabarti, Ryan O’Donnell and Benny Sudakov and has published in prestigious journals such as Physical Review Letters, IEEE Transactions on Information Theory and Monthly Notices of the Royal Astronomical Society.

In The Last Decade

Oded Regev

30 papers receiving 904 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Oded Regev United States	19	709	305	301	141	72	31	992
Graham Brightwell United Kingdom	19	638 0.9×	269 0.9×	184 0.6×	91 0.6×	36 0.5×	90	1.4k
Gideon Schechtman Israel	25	416 0.6×	226 0.7×	80 0.3×	93 0.7×	17 0.2×	100	2.1k
James R. Lee United States	17	668 0.9×	189 0.6×	254 0.8×	198 1.4×	34 0.5×	55	1.1k
A. Meir Canada	18	539 0.8×	157 0.5×	82 0.3×	93 0.7×	99 1.4×	75	1.7k
József Beck United States	21	590 0.8×	168 0.6×	80 0.3×	198 1.4×	45 0.6×	67	1.4k
Shlomo Hoory Israel	13	505 0.7×	313 1.0×	319 1.1×	34 0.2×	11 0.2×	31	1.2k
Yury Makarychev United States	15	502 0.7×	222 0.7×	212 0.7×	75 0.5×	12 0.2×	51	769
Prasad Raghavendra United States	19	689 1.0×	358 1.2×	256 0.9×	101 0.7×	20 0.3×	57	950
Cláudio L. Lucchesi Brazil	15	286 0.4×	88 0.3×	132 0.4×	26 0.2×	8 0.1×	41	779
Grzegorz Bancerek Poland	17	808 1.1×	496 1.6×	74 0.2×	29 0.2×	8 0.1×	60	1.6k

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-authorship network of co-authors of Oded Regev

This figure shows the co-authorship network connecting the top 25 collaborators of Oded Regev. A scholar is included among the top collaborators of Oded Regev based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Oded Regev. Oded Regev is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Briët, Jop, Oded Regev, & Rishi Saket. (2017). . Theory of Computing. 13(1). 1–24.

Barak, Boaz, Ankur Moitra, Ryan O’Donnell, et al.. (2015). Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15 indexed citations

Naor, Assaf, Oded Regev, & Thomas Vidick. (2014). . Theory of Computing. 10(1). 257–295. 3 indexed citations

Regev, Oded & Thomas Vidick. (2014). Elementary proofs of Grothendieck theorems for completely bounded norms. Journal of Operator Theory. 71(2). 491–506. 6 indexed citations

Haviv, Ishay & Oded Regev. (2012). Hardness of the Covering Radius Problem on Lattices.. 2012. 3 indexed citations

Haviv, Ishay & Oded Regev. (2012). . Theory of Computing. 8(1). 513–531. 20 indexed citations

Kempe, Julia, Oded Regev, & Ben Toner. (2010). Unique Games with Entangled Provers Are Easy. SIAM Journal on Computing. 39(7). 3207–3229. 32 indexed citations

Dinur, Irit, Elchanan Mossel, & Oded Regev. (2009). Conditional Hardness for Approximate Coloring. SIAM Journal on Computing. 39(3). 843–873. 52 indexed citations

Kempe, Julia, Oded Regev, & Ben Toner. (2008). The Unique Games Conjecture with Entangled Provers is False. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 0. 2 indexed citations

10.

Haviv, Ishay, Vadim Lyubashevsky, & Oded Regev. (2008). A Note on the Distribution of the Distance from a Lattice. Discrete & Computational Geometry. 41(1). 162–176. 6 indexed citations

11.

Dinur, Irit, Ehud Friedgut, & Oded Regev. (2008). Independent Sets in Graph Powers are Almost Contained in Juntas. Geometric and Functional Analysis. 18(1). 77–97. 18 indexed citations

12.

Haviv, Ishay, Oded Regev, & Amnon Ta‐Shma. (2007). . Theory of Computing. 3(1). 45–60. 2 indexed citations

13.

Umurhan, O. M., Kristen Menou, & Oded Regev. (2007). Weakly Nonlinear Analysis of the Magnetorotational Instability in a Model Channel Flow. Physical Review Letters. 98(3). 34501–34501. 26 indexed citations

14.

Khot, Subhash & Oded Regev. (2007). Vertex cover might be hard to approximate to within2−ε. Journal of Computer and System Sciences. 74(3). 335–349. 304 indexed citations

15.

Dinur, Irit, Elchanan Mossel, & Oded Regev. (2006). Conditional hardness for approximate coloring. 344–353. 35 indexed citations

16.

Guruswami, Venkatesan, Daniele Micciancio, & Oded Regev. (2005). The complexity of the covering radius problem. Computational Complexity. 14(2). 90–121. 28 indexed citations

17.

Dinur, Irit, Venkatesan Guruswami, Subhash Khot, & Oded Regev. (2005). A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. SIAM Journal on Computing. 34(5). 1129–1146. 62 indexed citations

18.

Khot, Subhash & Oded Regev. (2004). Vertex cover might be hard to approximate to within 2-ε. 379–386. 54 indexed citations

19.

Dinur, Irit, Venkatesan Guruswami, Subhash Khot, & Oded Regev. (2003). A new multilayered PCP and the hardness of hypergraph vertex cover. 595–601. 42 indexed citations

20.

Elphick, Christian, Oded Regev, & E. A. Spiegel. (1991). Complexity from thermal instability. Monthly Notices of the Royal Astronomical Society. 250(3). 617–628. 25 indexed citations

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