Travelled to:1 × Iceland
8 × USA
Collaborated with:∅ I.Dinur A.Chakrabarti B.Klartag L.Eldar J.Kempe R.d.Wolf L.Schiff I.Haviv R.Rosen A.Naor T.Vidick E.Mossel D.Aggarwal D.Dadush N.Stephens-Davidowitz F.Unger D.Gavinsky V.Guruswami S.Khot B.Awerbuch Y.Azar S.Leonardi Z.Brakerski A.Langlois C.Peikert D.Stehlé
Talks about:quantum (5) communic (4) hard (4) problem (3) lattic (3) error (3) bound (3) exponenti (2) shortest (2) complex (2)
Person: Oded Regev
DBLP: Regev:Oded
Contributed to:
201520132011
200820072006200520031999Wrote 16 papers:
- STOC-2015-AggarwalDRS #problem #using
- Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract (DA, DD, OR, NSD), pp. 733–742.
- STOC-2013-BrakerskiLPRS #fault #learning
- Classical hardness of learning with errors (ZB, AL, CP, OR, DS), pp. 575–584.
- STOC-2013-NaorRV #commutative #difference #performance
- Efficient rounding for the noncommutative grothendieck inequality (AN, OR, TV), pp. 71–80.
- STOC-2011-ChakrabartiR #bound #communication #complexity
- An optimal lower bound on the communication complexity of gap-hamming-distance (AC, OR), pp. 51–60.
- STOC-2011-RegevK #communication #quantum
- Quantum one-way communication can be exponentially stronger than classical communication (OR, BK), pp. 31–40.
- ICALP-A-2008-EldarR #quantum #satisfiability
- Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete (LE, OR), pp. 881–892.
- ICALP-A-2008-KempeRUW #bound #fault tolerance #quantum
- Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing (JK, OR, FU, RdW), pp. 845–856.
- ICALP-A-2008-RegevS #quantum
- Impossibility of a Quantum Speed-Up with a Faulty Oracle (OR, LS), pp. 773–781.
- STOC-2007-HavivR #polynomial #problem
- Tensor-based hardness of the shortest vector problem to within almost polynomial factors (IH, OR), pp. 469–477.
- STOC-2006-DinurMR #approximate
- Conditional hardness for approximate coloring (ID, EM, OR), pp. 344–353.
- STOC-2006-GavinskyKRW #bound #communication #complexity #exponential #identification #quantum
- Bounded-error quantum state identification and exponential separations in communication complexity (DG, JK, OR, RdW), pp. 594–603.
- STOC-2006-RegevR #problem
- Lattice problems and norm embeddings (OR, RR), pp. 447–456.
- STOC-2005-Regev #encryption #fault #learning #linear #on the #random
- On lattices, learning with errors, random linear codes, and cryptography (OR), pp. 84–93.
- STOC-2003-DinurGKR #multi
- A new multilayered PCP and the hardness of hypergraph vertex cover (ID, VG, SK, OR), pp. 595–601.
- STOC-2003-Regev #encryption
- New lattice based cryptographic constructions (OR), pp. 407–416.
- STOC-1999-AwerbuchALR #migration
- Minimizing the Flow Time Without Migration (BA, YA, SL, OR), pp. 198–205.