default search action
Oded Regev 0001
Person information
- affiliation: New York University, NY, USA
- affiliation: Tel Aviv University, Israel
Other persons with the same name
- Oded Regev 0002 — Technion, Israel Institute of Technology
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [i49]Oded Regev:
On Lattices, Learning with Errors, Random Linear Codes, and Cryptography. CoRR abs/2401.03703 (2024) - 2023
- [i48]Oded Regev:
An Efficient Quantum Factoring Algorithm. CoRR abs/2308.06572 (2023) - [i47]Or Ordentlich, Oded Regev, Barak Weiss:
Bounds on the density of smooth lattice coverings. CoRR abs/2311.04644 (2023) - 2021
- [c68]Joan Bruna, Oded Regev
, Min Jae Song
Continuous LWE. STOC 2021: 694-707 - [i46]Srinivasan Arunachalam, Oded Regev, Penghui Yao:
On the Gaussian surface area of spectrahedra. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c67]Ishan Agarwal, Oded Regev, Yi Tang:
Nearly Optimal Embeddings of Flat Tori. APPROX-RANDOM 2020: 43:1-43:14 - [c66]Alexander Golovnev, Gleb Posobin, Oded Regev, Omri Weinstein:
Polynomial Data Structure Lower Bounds in the Group Model. FOCS 2020: 740-751 - [i45]Joan Bruna, Oded Regev, Min Jae Song, Yi Tang:
Continuous LWE. CoRR abs/2005.09595 (2020) - [i44]Or Ordentlich, Oded Regev, Barak Weiss:
New bounds on the density of lattice coverings. CoRR abs/2006.00340 (2020) - [i43]Joan Bruna, Oded Regev, Min Jae Song, Yi Tang:
Continuous LWE. Electron. Colloquium Comput. Complex. TR20 (2020) - [i42]Alexander Golovnev, Gleb Posobin, Oded Regev, Omri Weinstein:
Polynomial Data Structure Lower Bounds in the Group Model. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2018
- [j44]Alexander Golovnev
The Minrank of Random Graphs. IEEE Trans. Inf. Theory 64(11): 6990-6995 (2018) - [i41]Ishay Haviv, Oded Regev, Amnon Ta-Shma:
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. CoRR abs/1806.04080 (2018) - [i40]Ishay Haviv, Oded Regev:
Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors. CoRR abs/1806.04087 (2018) - 2017
- [j43]Oded Regev, Noah Stephens-Davidowitz:
An Inequality for Gaussians on Lattices. SIAM J. Discret. Math. 31(2): 749-757 (2017) - [j42]Jop Briët, Oded Regev, Rishi Saket:
Tight Hardness of the Non-Commutative Grothendieck Problem. Theory Comput. 13(1): 1-24 (2017) - [c65]Alexander Golovnev, Oded Regev, Omri Weinstein:
The Minrank of Random Graphs. APPROX-RANDOM 2017: 46:1-46:13 - [c64]Oded Regev, Aravindan Vijayaraghavan:
On Learning Mixtures of Well-Separated Gaussians. FOCS 2017: 85-96 - [c63]Chris Peikert, Oded Regev, Noah Stephens-Davidowitz:
Pseudorandomness of ring-LWE for any ring and modulus. STOC 2017: 461-473 - [c62]Oded Regev, Noah Stephens-Davidowitz:
A reverse Minkowski theorem. STOC 2017: 941-953 - [i39]Shravas Rao, Oded Regev:
A Sharp Tail Bound for the Expander Random Sampler. CoRR abs/1703.10205 (2017) - [i38]Oded Regev, Aravindan Vijayaraghavan:
On Learning Mixtures of Well-Separated Gaussians. CoRR abs/1710.11592 (2017) - [i37]Anna Gál, Michal Koucký, Oded Regev, Till Tantau:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121). Dagstuhl Reports 7(3): 45-69 (2017) - [i36]Chris Peikert, Oded Regev, Noah Stephens-Davidowitz:
Pseudorandomness of Ring-LWE for Any Ring and Modulus. IACR Cryptol. ePrint Arch. 2017: 258 (2017) - 2016
- [j41]Divesh Aggarwal, Oded Regev:
A Note on Discrete Gaussian Combinations of Lattice Vectors. Chic. J. Theor. Comput. Sci. 2016 (2016) - [j40]Ishay Haviv, Oded Regev:
The List-Decoding Size of Fourier-Sparse Boolean Functions. ACM Trans. Comput. Theory 8(3): 10:1-10:14 (2016) - [c61]Ronald Cramer, Léo Ducas, Chris Peikert, Oded Regev:
Recovering Short Generators of Principal Ideals in Cyclotomic Rings. EUROCRYPT (2) 2016: 559-585 - [c60]Daniel Dadush, Oded Regev:
Towards Strong Reverse Minkowski-Type Inequalities for Lattices. FOCS 2016: 447-456 - [c59]Yael Tauman Kalai, Ran Raz
On the Space Complexity of Linear Programming with Preprocessing. ITCS 2016: 293-300 - [c58]Ishay Haviv, Oded Regev:
The Restricted Isometry Property of Subsampled Fourier Matrices. SODA 2016: 288-297 - [c57]Andris Ambainis, Aleksandrs Belovs, Oded Regev, Ronald de Wolf:
Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing. SODA 2016: 903-922 - [i35]Daniel Dadush, Oded Regev:
Towards Strong Reverse Minkowski-type Inequalities for Lattices. CoRR abs/1606.06913 (2016) - [i34]Alexander Golovnev, Oded Regev, Omri Weinstein:
The Minrank of Random Graphs. CoRR abs/1607.04842 (2016) - [i33]Alexander Golovnev, Oded Regev, Omri Weinstein:
The Minrank of Random Graphs. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j39]Oded Regev, Thomas Vidick
Quantum XOR Games. ACM Trans. Comput. Theory 7(4): 15:1-15:43 (2015) - [c56]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer
Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree. APPROX-RANDOM 2015: 110-123 - [c55]Ishay Haviv, Oded Regev:
The List-Decoding Size of Fourier-Sparse Boolean Functions. CCC 2015: 58-71 - [c54]Jop Briët, Oded Regev, Rishi Saket:
Tight Hardness of the Non-commutative Grothendieck Problem. FOCS 2015: 1108-1122 - [c53]Divesh Aggarwal, Daniel Dadush
Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract. STOC 2015: 733-742 - [i32]Ishay Haviv, Oded Regev:
The List-Decoding Size of Fourier-Sparse Boolean Functions. CoRR abs/1504.01649 (2015) - [i31]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the random assignment on constraint satisfaction problems of bounded degree. CoRR abs/1505.03424 (2015) - [i30]Ishay Haviv, Oded Regev:
The Restricted Isometry Property of Subsampled Fourier Matrices. CoRR abs/1507.01768 (2015) - [i29]Andris Ambainis, Aleksandrs Belovs, Oded Regev, Ronald de Wolf:
Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing. CoRR abs/1507.03126 (2015) - [i28]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the random assignment on constraint satisfaction problems of bounded degree. Electron. Colloquium Comput. Complex. TR15 (2015) - [i27]Ronald Cramer, Léo Ducas, Chris Peikert, Oded Regev:
Recovering Short Generators of Principal Ideals in Cyclotomic Rings. IACR Cryptol. ePrint Arch. 2015: 313 (2015) - 2014
- [j38]Assaf Naor, Oded Regev, Thomas Vidick
Efficient Rounding for the Noncommutative Grothendieck Inequality. Theory Comput. 10: 257-295 (2014) - [c52]Daniel Dadush
On the Closest Vector Problem with a Distance Guarantee. CCC 2014: 98-109 - [c51]Ishay Haviv, Oded Regev:
On the Lattice Isomorphism Problem. SODA 2014: 391-404 - [i26]Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz:
On the Closest Vector Problem with a Distance Guarantee. CoRR abs/1409.8063 (2014) - [i25]Jop Briët, Oded Regev:
Tight Hardness of the Non-commutative Grothendieck Problem. CoRR abs/1412.4413 (2014) - [i24]Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz:
Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling. CoRR abs/1412.7994 (2014) - [i23]Anna Gál, Michal Koucký, Oded Regev, Rüdiger Reischuk:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121). Dagstuhl Reports 4(3): 62-84 (2014) - 2013
- [j37]Vadim Lyubashevsky, Chris Peikert, Oded Regev:
On Ideal Lattices and Learning with Errors over Rings. J. ACM 60(6): 43:1-43:35 (2013) - [c50]Oded Regev, Thomas Vidick
Quantum XOR Games. CCC 2013: 144-155 - [c49]Vadim Lyubashevsky, Chris Peikert, Oded Regev:
A Toolkit for Ring-LWE Cryptography. EUROCRYPT 2013: 35-54 - [c48]Assaf Naor, Oded Regev, Thomas Vidick
Efficient rounding for the noncommutative grothendieck inequality. STOC 2013: 71-80 - [c47]Zvika Brakerski, Adeline Langlois
Classical hardness of learning with errors. STOC 2013: 575-584 - [i22]Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, Damien Stehlé:
Classical Hardness of Learning with Errors. CoRR abs/1306.0281 (2013) - [i21]Divesh Aggarwal, Oded Regev:
A Note on Discrete Gaussian Combinations of Lattice Vectors. CoRR abs/1308.2405 (2013) - [i20]Ishay Haviv, Oded Regev:
On the Lattice Isomorphism Problem. CoRR abs/1311.0366 (2013) - [i19]Vadim Lyubashevsky, Chris Peikert, Oded Regev:
A Toolkit for Ring-LWE Cryptography. IACR Cryptol. ePrint Arch. 2013: 293 (2013) - 2012
- [j36]Ishay Haviv, Oded Regev:
Hardness of the Covering Radius Problem on Lattices. Chic. J. Theor. Comput. Sci. 2012 (2012) - [j35]Oded Regev:
Bell violations through independent bases games. Quantum Inf. Comput. 12(1-2): 9-20 (2012) - [j34]Amit Chakrabarti
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance. SIAM J. Comput. 41(5): 1299-1317 (2012) - [j33]Ishay Haviv, Oded Regev:
Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors. Theory Comput. 8(1): 513-531 (2012) - [j32]Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf:
Near-Optimal and Explicit Bell Inequality Violations. Theory Comput. 8(1): 623-645 (2012) - [i18]Jop Briët, Assaf Naor, Oded Regev:
Locally decodable codes and the failure of cotype for projective tensor products. CoRR abs/1208.0539 (2012) - [i17]Assaf Naor, Oded Regev, Thomas Vidick:
Efficient rounding for the noncommutative Grothendieck inequality. CoRR abs/1210.7656 (2012) - [i16]Vadim Lyubashevsky, Chris Peikert, Oded Regev:
On Ideal Lattices and Learning with Errors Over Rings. IACR Cryptol. ePrint Arch. 2012: 230 (2012) - 2011
- [c46]Harry Buhrman, Oded Regev, Giannicola Scarpa
Near-Optimal and Explicit Bell Inequality Violations. CCC 2011: 157-166 - [c45]Oded Regev, Bo'az Klartag:
Quantum one-way communication can be exponentially stronger than classical communication. STOC 2011: 31-40 - [c44]Amit Chakrabarti
An optimal lower bound on the communication complexity of gap-hamming-distance. STOC 2011: 51-60 - 2010
- [j31]Julia Kempe
Upper bounds on the noise threshold for fault-tolerant quantum computing. Quantum Inf. Comput. 10(5&6): 361-376 (2010) - [j30]Amit Chakrabarti, Oded Regev:
An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching. SIAM J. Comput. 39(5): 1919-1940 (2010) - [j29]Julia Kempe
Unique Games with Entangled Provers Are Easy. SIAM J. Comput. 39(7): 3207-3229 (2010) - [c43]Oded Regev:
Learning with Errors over Rings. ANTS 2010: 3 - [c42]Ishay Haviv, Oded Regev:
The Euclidean Distortion of Flat Tori. APPROX-RANDOM 2010: 232-245 - [c41]Joshua Brody, Amit Chakrabarti
Better Gap-Hamming Lower Bounds via Better Round Elimination. APPROX-RANDOM 2010: 476-489 - [c40]Julia Kempe
No Strong Parallel Repetition with Entangled and Non-signaling Provers. CCC 2010: 7-15 - [c39]Oded Regev:
The Learning with Errors Problem (Invited Survey). CCC 2010: 191-204 - [c38]Vadim Lyubashevsky, Chris Peikert, Oded Regev:
On Ideal Lattices and Learning with Errors over Rings. EUROCRYPT 2010: 1-23 - [c37]Nicolas Gama, Phong Q. Nguyen, Oded Regev:
Lattice Enumeration Using Extreme Pruning. EUROCRYPT 2010: 257-278 - [p1]Oded Regev:
On the Complexity of Lattice Problems with Polynomial Approximation Factors. The LLL Algorithm 2010: 475-496 - [i15]Amit Chakrabarti, Oded Regev:
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance. CoRR abs/1009.3460 (2010) - [i14]Bo'az Klartag, Oded Regev:
Quantum One-Way Communication is Exponentially Stronger Than Classical Communication. CoRR abs/1009.3640 (2010) - [i13]Amit Chakrabarti, Oded Regev:
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance. Electron. Colloquium Comput. Complex. TR10 (2010) - [i12]Bo'az Klartag, Oded Regev:
Quantum One-Way Communication is Exponentially Stronger Than Classical Communication. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j28]Ishay Haviv, Vadim Lyubashevsky, Oded Regev:
A Note on the Distribution of the Distance from a Lattice. Discret. Comput. Geom. 41(1): 162-176 (2009) - [j27]Oded Regev:
On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6): 34:1-34:40 (2009) - [j26]Phong Q. Nguyen, Oded Regev:
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures. J. Cryptol. 22(2): 139-160 (2009) - [j25]Dmitry Gavinsky, Julia Kempe
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity. SIAM J. Comput. 39(1): 1-24 (2009) - [j24]Irit Dinur
Conditional Hardness for Approximate Coloring. SIAM J. Comput. 39(3): 843-873 (2009) - [j23]Oded Regev, Ben Toner:
Simulating Quantum Correlations with Finite Communication. SIAM J. Comput. 39(4): 1562-1580 (2009) - [i11]Julia Kempe, Oded Regev:
No Strong Parallel Repetition with Entangled and Non-signaling Provers. CoRR abs/0911.0201 (2009) - [i10]Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf:
Better Gap-Hamming Lower Bounds via Better Round Elimination. CoRR abs/0912.5276 (2009) - 2008
- [j22]Dmitry Gavinsky, Oded Regev, Ronald de Wolf:
Simultaneous Communication Protocols with Quantum and Classical Messages. Chic. J. Theor. Comput. Sci. 2008 (2008) - [j21]Subhash Khot, Oded Regev:
Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci. 74(3): 335-349 (2008) - [j20]Dorit Aharonov, Wim van Dam, Julia Kempe
Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation. SIAM Rev. 50(4): 755-787 (2008) - [c36]Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer
Rounding Parallel Repetitions of Unique Games. FOCS 2008: 374-383 - [c35]Julia Kempe, Oded Regev, Ben Toner:
Unique Games with Entangled Provers are Easy. FOCS 2008: 457-466 - [c34]Avraham Ben-Aroya, Oded Regev, Ronald de Wolf:
A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs. FOCS 2008: 477-486 - [c33]Oded Regev, Liron Schiff:
Impossibility of a Quantum Speed-Up with a Faulty Oracle. ICALP (1) 2008: 773-781 - [c32]Julia Kempe
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. ICALP (1) 2008: 845-856 - [c31]Lior Eldar, Oded Regev:
Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete. ICALP (1) 2008: 881-892 - 2007
- [j19]Dorit Aharonov, Wim van Dam, Julia Kempe
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. SIAM J. Comput. 37(1): 166-194 (2007) - [j18]Daniele Micciancio
Worst-Case to Average-Case Reductions Based on Gaussian Measures. SIAM J. Comput. 37(1): 267-302 (2007) - [j17]Ishay Haviv, Oded Regev, Amnon Ta-Shma:
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. Theory Comput. 3(1): 45-60 (2007) - [c30]Oded Regev, Ben Toner:
Simulating Quantum Correlations with Finite Communication. FOCS 2007: 384-394 - [c29]Ishay Haviv, Oded Regev:
Tensor-based hardness of the shortest vector problem to within almost polynomial factors. STOC 2007: 469-477 - [i9]Julia Kempe, Oded Regev, Ben Toner:
The Unique Games Conjecture with Entangled Provers is False. Algebraic Methods in Computational Complexity 2007 - 2006
- [j16]Yossi Azar, Oded Regev:
Combinatorial Algorithms for the Unsplittable Flow Problem. Algorithmica 44(1): 49-66 (2006) - [j15]Julia Kempe
The Complexity of the Local Hamiltonian Problem. SIAM J. Comput. 35(5): 1070-1097 (2006) - [c28]Ishay Haviv, Oded Regev:
Hardness of the Covering Radius Problem on Lattices. CCC 2006: 145-158 - [c27]Oded Regev:
Lattice-Based Cryptography. CRYPTO 2006: 131-141 - [c26]Phong Q. Nguyen, Oded Regev:
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures. EUROCRYPT 2006: 271-288 - [c25]Irit Dinur, Elchanan Mossel, Oded Regev:
Conditional hardness for approximate coloring. STOC 2006: 344-353 - [c24]Oded Regev, Ricky Rosen:
Lattice problems and norm embeddings. STOC 2006: 447-456 - [c23]Dmitry Gavinsky, Julia Kempe
Bounded-error quantum state identification and exponential separations in communication complexity. STOC 2006: 594-603 - 2005
- [j14]Venkatesan Guruswami, Daniele Micciancio
The complexity of the covering radius problem. Comput. Complex. 14(2): 90-121 (2005) - [j13]Irit Dinur
The Hardness of 3-Uniform Hypergraph Coloring. Comb. 25(5): 519-535 (2005) - [j12]Dorit Aharonov, Oded Regev:
Lattice problems in NP cap coNP. J. ACM 52(5): 749-765 (2005) - [j11]Irit Dinur
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. SIAM J. Comput. 34(5): 1129-1146 (2005) - [c22]Oded Regev:
On lattices, learning with errors, random linear codes, and cryptography. STOC 2005: 84-93 - [i8]Irit Dinur, Elchanan Mossel, Oded Regev:
Conditional Hardness for Approximate Coloring. CoRR abs/cs/0504062 (2005) - [i7]Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf:
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity. CoRR abs/quant-ph/0511013 (2005) - [i6]Irit Dinur, Elchanan Mossel, Oded Regev:
Conditional Hardness for Approximate Coloring. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j10]József Balogh, Oded Regev, Clifford D. Smyth
Long Monotone Paths in Line Arrangements. Discret. Comput. Geom. 32(2): 167-176 (2004) - [j9]Oded Regev:
New lattice-based cryptographic constructions. J. ACM 51(6): 899-942 (2004) - [j8]Oded Regev:
Quantum Computation and Lattice Problems. SIAM J. Comput. 33(3): 738-760 (2004) - [j7]Oded Regev:
Improved Inapproximability of Lattice and Coding Problems With Preprocessing. IEEE Trans. Inf. Theory 50(9): 2031-2037 (2004) - [c21]Venkatesan Guruswami, Daniele Micciancio
The Complexity of the Covering Radius Problem on Lattices and Codes. CCC 2004: 161-173 - [c20]Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev:
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. FOCS 2004: 42-51 - [c19]Dorit Aharonov, Oded Regev:
Lattice Problems in NP cap coNP. FOCS 2004: 362-371 - [c18]Daniele Micciancio, Oded Regev:
Worst-Case to Average-Case Reductions Based on Gaussian Measures. FOCS 2004: 372-381 - [c17]Amit Chakrabarti, Oded Regev:
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching. FOCS 2004: 473-482 - [c16]Julia Kempe
The Complexity of the Local Hamiltonian Problem. FSTTCS 2004: 372-383 - [i5]Julia Kempe, Alexei Y. Kitaev, Oded Regev:
The Complexity of the Local Hamiltonian Problem. CoRR quant-ph/0406180 (2004) - 2003
- [j6]Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev:
On-line restricted assignment of temporary tasks with unknown durations. Inf. Process. Lett. 85(2): 67-72 (2003) - [j5]Julia Kempe, Oded Regev:
3-local Hamiltonian is QMA-complete. Quantum Inf. Comput. 3(3): 258-264 (2003) - [c15]Oded Regev:
Improved Inapproximability of Lattice and Coding Problems with Preprocessing. CCC 2003: 363-370 - [c14]Subhash Khot, Oded Regev:
Vertex Cover Might be Hard to Approximate to within 2-\varepsilon. CCC 2003: 379- - [c13]József Balogh, Oded Regev, Clifford D. Smyth
Long monotone paths in line arrangements. SCG 2003: 124-128 - [c12]Dorit Aharonov, Oded Regev:
A Lattice Problem in Quantum NP. FOCS 2003: 210-219 - [c11]Oded Regev:
New lattice based cryptographic constructions. STOC 2003: 407-416 - [c10]Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev:
A new multilayered PCP and the hardness of hypergraph vertex cover. STOC 2003: 595-601 - [i4]Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev:
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. CoRR cs.CC/0304026 (2003) - [i3]Oded Regev:
New Lattice Based Cryptographic Constructions. CoRR cs.CR/0309051 (2003) - [i2]Oded Regev:
Quantum Computation and Lattice Problems. CoRR cs.DS/0304005 (2003) - [i1]Amit Chakrabarti, Oded Regev:
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j4]Oded Regev:
Priority algorithms for makespan minimization in the subset model. Inf. Process. Lett. 84(3): 153-157 (2002) - [j3]Baruch Awerbuch, Yossi Azar
Minimizing the Flow Time Without Migration. SIAM J. Comput. 31(5): 1370-1382 (2002) - [j2]Yossi Azar
Off-line temporary tasks assignment. Theor. Comput. Sci. 287(2): 419-428 (2002) - [c9]Irit Dinur, Oded Regev, Clifford D. Smyth
The Hardness of 3 - Uniform Hypergraph Coloring. FOCS 2002: 33- - [c8]Oded Regev:
Quantum Computation and Lattice Problems. FOCS 2002: 520-529 - [c7]Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev:
Temporary tasks assignment resolved. SODA 2002: 116-124 - 2001
- [b1]Oded Regev:
Scheduling and load balancing. Tel Aviv University, Israel, 2001 - [j1]Yossi Azar
On-line bin-stretching. Theor. Comput. Sci. 268(1): 17-41 (2001) - [c6]Yossi Azar, Oded Regev:
Strongly Polynomial Algorithms for the Unsplittable Flow Problem. IPCO 2001: 15-29 - 2000
- [c5]Baruch Awerbuch, Yossi Azar, Oded Regev:
Maximizing job benefits on-line. APPROX 2000: 42-50
1990 – 1999
- 1999
- [c4]Yossi Azar, Oded Regev:
Off-Line Temporary Tasks Assignment. ESA 1999: 163-171 - [c3]Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev:
Minimizing the Flow Time Without Migration. STOC 1999: 198-205 - 1998
- [c2]Noam Nisan
Globally Distributed Computation over the Internet - The POPCORN Project. ICDCS 1998: 592-601 - [c1]Yossi Azar, Oded Regev:
On-Line Bin-Stretching. RANDOM 1998: 71-81
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: