| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Vadim Lyubashevsky, Chris Peikert, Oded Regev |
On Ideal Lattices and Learning with Errors Over Rings.  |
IACR Cryptology ePrint Archive  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf |
Near-Optimal and Explicit Bell Inequality Violations. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Regev, Bo'az Klartag |
Quantum one-way communication can be exponentially stronger than classical communication. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Chakrabarti, Oded Regev |
An optimal lower bound on the communication complexity of gap-hamming-distance. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Chakrabarti, Oded Regev |
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Bo'az Klartag, Oded Regev |
Quantum One-Way Communication is Exponentially Stronger Than Classical Communication. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf |
Upper bounds on the noise threshold for fault-tolerant quantum computing. |
Quantum Information & Computation |
2010 |
DBLP BibTeX RDF |
|
| 1 | Amit Chakrabarti, Oded Regev |
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Bo'az Klartag, Oded Regev |
Quantum One-Way Communication is Exponentially Stronger Than Classical Communication |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Julia Kempe, Oded Regev, Ben Toner |
Unique Games with Entangled Provers Are Easy. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Chakrabarti, Oded Regev |
An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Gama, Phong Q. Nguyen, Oded Regev |
Lattice Enumeration Using Extreme Pruning. |
EUROCRYPT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Chris Peikert, Oded Regev |
On Ideal Lattices and Learning with Errors over Rings. |
EUROCRYPT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Regev |
Learning with Errors over Rings. |
ANTS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf |
Better Gap-Hamming Lower Bounds via Better Round Elimination. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ishay Haviv, Oded Regev |
The Euclidean Distortion of Flat Tori. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Regev |
The Learning with Errors Problem (Invited Survey). |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
learning with errors, lattice-based cryptography |
| 1 | Julia Kempe, Oded Regev |
No Strong Parallel Repetition with Entangled and Non-signaling Provers. |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
entangled two-prover games, unique games, parallel repetition |
| 1 | Oded Regev |
On lattices, learning with errors, random linear codes, and cryptography. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
average-case hardness, cryptography, quantum computation, Lattice, public key encryption |
| 1 | Ishay Haviv, Vadim Lyubashevsky, Oded Regev |
A Note on the Distribution of the Distance from a Lattice. |
Discrete & Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
Second moment, Computational complexity, Lattices, Geometrical invariants, Covering radius |
| 1 | Phong Q. Nguyen, Oded Regev |
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures. |
J. Cryptology |
2009 |
DBLP DOI BibTeX RDF |
GGH, NTRUSign, Lattices, Moment, Gradient descent, Public-key cryptanalysis |
| 1 | Julia Kempe, Oded Regev |
No Strong Parallel Repetition with Entangled and Non-signaling Provers |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf |
Better Gap-Hamming Lower Bounds via Better Round Elimination |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf |
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Regev, Ben Toner |
Simulating Quantum Correlations with Finite Communication. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Elchanan Mossel, Oded Regev |
Conditional Hardness for Approximate Coloring. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Regev |
Astrophysics, Chaos and Complexity in. |
Encyclopedia of Complexity and Systems Science |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Oded Regev, Ronald de Wolf |
Simultaneous Communication Protocols with Quantum and Classical Messages. |
Chicago J. Theor. Comput. Sci. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Subhash Khot, Oded Regev |
Vertex cover might be hard to approximate to within 2-epsilon. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Lior Eldar, Oded Regev |
Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf |
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Regev, Liron Schiff |
Impossibility of a Quantum Speed-Up with a Faulty Oracle. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Oded Regev, Ben Toner |
Unique Games with Entangled Provers are Easy. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Avraham Ben-Aroya, Oded Regev, Ronald de Wolf |
A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer |
Rounding Parallel Repetitions of Unique Games. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ishay Haviv, Oded Regev, Amnon Ta-Shma |
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. |
Theory of Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev |
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Oded Regev |
Worst-Case to Average-Case Reductions Based on Gaussian Measures. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Oded Regev, Ben Toner |
The Unique Games Conjecture with Entangled Provers is False. |
Algebraic Methods in Computational Complexity |
2007 |
DBLP BibTeX RDF |
|
| 1 | Oded Regev, Ben Toner |
Simulating Quantum Correlations with Finite Communication. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ishay Haviv, Oded Regev |
Tensor-based hardness of the shortest vector problem to within almost polynomial factors. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
lattices, hardness of approximation, tensor product |
| 1 | Yossi Azar, Oded Regev |
Combinatorial Algorithms for the Unsplittable Flow Problem. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Unsplittable flow problem, Combinatorial algorithms |
| 1 | Julia Kempe, Alexei Kitaev, Oded Regev |
The Complexity of the Local Hamiltonian Problem. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Regev |
Chaos and complexity in astrophysics. |
|
2006 |
RDF |
|
| 1 | Phong Q. Nguyen, Oded Regev |
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures. |
EUROCRYPT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Regev |
Lattice-Based Cryptography. |
CRYPTO |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ishay Haviv, Oded Regev |
Hardness of the Covering Radius Problem on Lattices. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Regev, Ricky Rosen |
Lattice problems and norm embeddings. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
embedding, lattices, norms, hardness of approximation |
| 1 | Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf |
Bounded-error quantum state identification and exponential separations in communication complexity. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
quantum computing, randomness, communication complexity, entanglement, state identification |
| 1 | Irit Dinur, Elchanan Mossel, Oded Regev |
Conditional hardness for approximate coloring. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
graph coloring, hardness of approximation, unique games conjecture |
| 1 | Irit Dinur, Elchanan Mossel, Oded Regev |
Conditional Hardness for Approximate Coloring |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Dorit Aharonov, Oded Regev |
Lattice problems in NP cap coNP. |
J. ACM |
2005 |
DBLP DOI BibTeX RDF |
Algorithms, approximation, lattices, Fourier series |
| 1 | Irit Dinur, Oded Regev, Clifford D. Smyth |
The Hardness of 3-Uniform Hypergraph Coloring. |
Combinatorica |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68Q17 |
| 1 | Venkatesan Guruswami, Daniele Micciancio, Oded Regev |
The complexity of the covering radius problem. |
Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
11H06, 11H31, 68Q25, 94B05, Subject classification. 68Q17 |
| 1 | Irit Dinur, Elchanan Mossel, Oded Regev |
Conditional Hardness for Approximate Coloring |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf |
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev |
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Regev |
On lattices, learning with errors, random linear codes, and cryptography. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
cryptography, quantum computing, lattices, public key encryption, computational learning theory, statistical queries |
| 1 | Oded Regev |
New lattice-based cryptographic constructions. |
J. ACM |
2004 |
DBLP DOI BibTeX RDF |
average-case hardness, cryptography, quantum computing, Lattice, public key encryption |
| 1 | József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy |
Long Monotone Paths in Line Arrangements. |
Discrete & Computational Geometry |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Alexei Kitaev, Oded Regev |
The Complexity of the Local Hamiltonian Problem |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Oded Regev |
Quantum Computation and Lattice Problems. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Regev |
Improved Inapproximability of Lattice and Coding Problems With Preprocessing. |
IEEE Transactions on Information Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Oded Regev |
Worst-Case to Average-Case Reductions Based on Gaussian Measures. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit Aharonov, Oded Regev |
Lattice Problems in NP cap coNP. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev |
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Chakrabarti, Oded Regev |
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Daniele Micciancio, Oded Regev |
The Complexity of the Covering Radius Problem on Lattices and Codes. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Alexei Kitaev, Oded Regev |
The Complexity of the Local Hamiltonian Problem. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev |
On-line restricted assignment of temporary tasks with unknown durations. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Chakrabarti, Oded Regev |
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Julia Kempe, Oded Regev |
3-local Hamitonian is QMA-complete. |
Quantum Information & Computation |
2003 |
DBLP BibTeX RDF |
|
| 1 | Oded Regev |
Quantum Computation and Lattice Problems |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev |
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Oded Regev |
New Lattice Based Cryptographic Constructions |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy |
Long monotone paths in line arrangements. |
Symposium on Computational Geometry |
2003 |
DBLP DOI BibTeX RDF |
discrete line arrangements, monotone paths |
| 1 | Dorit Aharonov, Oded Regev |
A Lattice Problem in Quantum NP. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Subhash Khot, Oded Regev |
Vertex Cover Might be Hard to Approximate to within 2-\varepsilon. |
IEEE Conference on Computational Complexity |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Regev |
Improved Inapproximability of Lattice and Coding Problems with Preprocessing. |
IEEE Conference on Computational Complexity |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev |
A new multilayered PCP and the hardness of hypergraph vertex cover. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
hypergraph vertex cover, long code, multilayered PCP, hardness of approximation |
| 1 | Oded Regev |
New lattice based cryptographic constructions. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
average-case hardness, cryptography, quantum computing, lattices, public key encryption |
| 1 | Oded Regev |
Priority algorithms for makespan minimization in the subset model. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Azar, Oded Regev, Jiri Sgall, Gerhard J. Woeginger |
Off-line temporary tasks assignment. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev |
Minimizing the Flow Time Without Migration. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev |
Temporary tasks assignment resolved. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Regev |
Quantum Computation and Lattice Problems. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Oded Regev, Clifford D. Smyth |
The Hardness of 3 - Uniform Hypergraph Coloring. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Azar, Oded Regev |
On-line bin-stretching. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Azar, Oded Regev |
Strongly Polynomial Algorithms for the Unsplittable Flow Problem. |
IPCO |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Baruch Awerbuch, Yossi Azar, Oded Regev |
Maximizing job benefits on-line. |
APPROX |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Azar, Oded Regev |
Off-Line Temporary Tasks Assignment. |
ESA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev |
Minimizing the Flow Time Without Migration. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Azar, Oded Regev |
On-Line Bin-Stretching. |
RANDOM |
1998 |
DBLP DOI BibTeX RDF |
bin-stretching, scheduling, approximation algorithms, load balancing, On-line algorithms, bin-packing |
| 1 | Noam Nisan, Shmulik London, Oded Regev, Noam Camiel |
Globally Distributed Computation over the Internet - The POPCORN Project. |
ICDCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew R. King, Oded Regev |
Physics with answers - 500 problems and solutions. |
|
1997 |
RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")