Concepedia

Oded Regev

OR

Statistics

Publications

28

Citations

2.3K

H-Index

23

Active since

1991

Affiliations

Tel Aviv University(Current)

Institute for Advanced Study

Princeton University

University of Washington

University of California, Berkeley

Oded Regev is an author at Tel Aviv University specializing in computer science, mathematics, and algorithms.

Publications per year

1991–2015

28

Publications

28

Vertex cover might be hard to approximate to within<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>2</mml:mn><mml:mo>−</mml:mo><mml:mi>ε</mml:mi></mml:math>

Subhash Khot, Oded Regev · Journal of Computer and System Sciences · 2007 · 761 citations

, , +5

A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover

Irit Dinur, Venkatesan Guruswami, Subhash Khot et al. · SIAM Journal on Computing · 2005 · 128 citations

, , +13

Conditional Hardness for Approximate Coloring

Irit Dinur, Elchanan Mossel, Oded Regev · SIAM Journal on Computing · 2009 · 122 citations

, , +9

Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality

Elchanan Mossel, Ryan O’Donnell, Oded Regev et al. · Israel Journal of Mathematics · 2006 · 112 citations

, , +12

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

Subhash Khot, Oded Regev · 2004 · 98 citations

, , +10

1–5 of 28