Oded Regev - RankMe

165 papers A* 40A 13B 1Journal 94Unranked 15

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	An Efficient Quantum Factoring Algorithm. J. ACM Oded Regev
2024	J	`jnl`	On Lattices, Learning with Errors, Random Linear Codes, and Cryptography. CoRR Oded Regev
2024	J	`jnl`	Polynomial Data Structure Lower Bounds in the Group Model. SIAM J. Comput. Alexander Golovnev, Gleb Posobin, Oded Regev, Omri Weinstein
2023	J	`jnl`	An Efficient Quantum Factoring Algorithm. CoRR Oded Regev
2023	J	`jnl`	Bounds on the density of smooth lattice coverings. CoRR Or Ordentlich, Oded Regev, Barak Weiss
2021	A*	`conf`	Continuous LWE. STOC Joan Bruna, Oded Regev, Min Jae Song, Yi Tang
2021	J	`jnl`	On the Gaussian surface area of spectrahedra. Electron. Colloquium Comput. Complex. Srinivasan Arunachalam, Oded Regev, Penghui Yao
2020	J	`jnl`	Continuous LWE. CoRR Joan Bruna, Oded Regev, Min Jae Song, Yi Tang
2020	J	`jnl`	Continuous LWE. Electron. Colloquium Comput. Complex. Joan Bruna, Oded Regev, Min Jae Song, Yi Tang
2020	—	`conf`	Nearly Optimal Embeddings of Flat Tori. APPROX-RANDOM Ishan Agarwal, Oded Regev, Yi Tang
2020	J	`jnl`	New bounds on the density of lattice coverings. CoRR Or Ordentlich, Oded Regev, Barak Weiss
2020	A*	`conf`	Polynomial Data Structure Lower Bounds in the Group Model. FOCS Alexander Golovnev, Gleb Posobin, Oded Regev, Omri Weinstein
2020	J	`jnl`	Polynomial Data Structure Lower Bounds in the Group Model. Electron. Colloquium Comput. Complex. Alexander Golovnev, Gleb Posobin, Oded Regev, Omri Weinstein
2018	J	`jnl`	On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. CoRR Ishay Haviv, Oded Regev, Amnon Ta-Shma
2018	J	`jnl`	Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors. CoRR Ishay Haviv, Oded Regev
2018	J	`jnl`	The Minrank of Random Graphs. IEEE Trans. Inf. Theory Alexander Golovnev, Oded Regev, Omri Weinstein
2017	J	`jnl`	A Sharp Tail Bound for the Expander Random Sampler. CoRR Shravas Rao, Oded Regev
2017	A*	`conf`	A reverse Minkowski theorem. STOC Oded Regev, Noah Stephens-Davidowitz
2017	J	`jnl`	An Inequality for Gaussians on Lattices. SIAM J. Discret. Math. Oded Regev, Noah Stephens-Davidowitz
2017	J	`jnl`	Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121). Dagstuhl Reports Anna Gál, Michal Koucký, Oded Regev, Till Tantau
2017	A*	`conf`	On Learning Mixtures of Well-Separated Gaussians. FOCS Oded Regev, Aravindan Vijayaraghavan
2017	J	`jnl`	On Learning Mixtures of Well-Separated Gaussians. CoRR Oded Regev, Aravindan Vijayaraghavan
2017	J	`jnl`	Pseudorandomness of Ring-LWE for Any Ring and Modulus. IACR Cryptol. ePrint Arch. Chris Peikert, Oded Regev, Noah Stephens-Davidowitz
2017	A*	`conf`	Pseudorandomness of ring-LWE for any ring and modulus. STOC Chris Peikert, Oded Regev, Noah Stephens-Davidowitz
2017	—	`conf`	The Minrank of Random Graphs. APPROX-RANDOM Alexander Golovnev, Oded Regev, Omri Weinstein
2017	J	`jnl`	Tight Hardness of the Non-Commutative Grothendieck Problem. Theory Comput. Jop Briët, Oded Regev, Rishi Saket
2016	J	`jnl`	A Note on Discrete Gaussian Combinations of Lattice Vectors. Chic. J. Theor. Comput. Sci. Divesh Aggarwal, Oded Regev
2016	A*	`conf`	Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing. SODA Andris Ambainis, Aleksandrs Belovs, Oded Regev, Ronald de Wolf
2016	A	`conf`	On the Space Complexity of Linear Programming with Preprocessing. ITCS Yael Tauman Kalai, Ran Raz, Oded Regev
2016	—	`conf`	Recovering Short Generators of Principal Ideals in Cyclotomic Rings. EUROCRYPT (2) Ronald Cramer, Léo Ducas, Chris Peikert, Oded Regev
2016	J	`jnl`	The List-Decoding Size of Fourier-Sparse Boolean Functions. ACM Trans. Comput. Theory Ishay Haviv, Oded Regev
2016	J	`jnl`	The Minrank of Random Graphs. CoRR Alexander Golovnev, Oded Regev, Omri Weinstein
2016	J	`jnl`	The Minrank of Random Graphs. Electron. Colloquium Comput. Complex. Alexander Golovnev, Oded Regev, Omri Weinstein
2016	A*	`conf`	The Restricted Isometry Property of Subsampled Fourier Matrices. SODA Ishay Haviv, Oded Regev
2016	A*	`conf`	Towards Strong Reverse Minkowski-Type Inequalities for Lattices. FOCS Daniel Dadush, Oded Regev
2016	J	`jnl`	Towards Strong Reverse Minkowski-type Inequalities for Lattices. CoRR Daniel Dadush, Oded Regev
2015	—	`conf`	Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree. APPROX-RANDOM Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright
2015	J	`jnl`	Beating the random assignment on constraint satisfaction problems of bounded degree. CoRR Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright
2015	J	`jnl`	Beating the random assignment on constraint satisfaction problems of bounded degree. Electron. Colloquium Comput. Complex. Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright
2015	J	`jnl`	Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing. CoRR Andris Ambainis, Aleksandrs Belovs, Oded Regev, Ronald de Wolf
2015	J	`jnl`	Quantum XOR Games. ACM Trans. Comput. Theory Oded Regev, Thomas Vidick
2015	J	`jnl`	Recovering Short Generators of Principal Ideals in Cyclotomic Rings. IACR Cryptol. ePrint Arch. Ronald Cramer, Léo Ducas, Chris Peikert, Oded Regev
2015	A*	`conf`	Solving the Shortest Vector Problem in 2 STOC Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz
2015	A	`conf`	The List-Decoding Size of Fourier-Sparse Boolean Functions. CCC Ishay Haviv, Oded Regev
2015	J	`jnl`	The List-Decoding Size of Fourier-Sparse Boolean Functions. CoRR Ishay Haviv, Oded Regev
2015	J	`jnl`	The Restricted Isometry Property of Subsampled Fourier Matrices. CoRR Ishay Haviv, Oded Regev
2015	A*	`conf`	Tight Hardness of the Non-commutative Grothendieck Problem. FOCS Jop Briët, Oded Regev, Rishi Saket
2014	J	`jnl`	Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121). Dagstuhl Reports Anna Gál, Michal Koucký, Oded Regev, Rüdiger Reischuk
2014	J	`jnl`	Efficient Rounding for the Noncommutative Grothendieck Inequality. Theory Comput. Assaf Naor, Oded Regev, Thomas Vidick
2014	A	`conf`	On the Closest Vector Problem with a Distance Guarantee. CCC Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz
2014	J	`jnl`	On the Closest Vector Problem with a Distance Guarantee. CoRR Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz
2014	A*	`conf`	On the Lattice Isomorphism Problem. SODA Ishay Haviv, Oded Regev
2014	J	`jnl`	Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling. CoRR Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz
2014	J	`jnl`	Tight Hardness of the Non-commutative Grothendieck Problem. CoRR Jop Briët, Oded Regev
2013	J	`jnl`	A Note on Discrete Gaussian Combinations of Lattice Vectors. CoRR Divesh Aggarwal, Oded Regev
2013	A*	`conf`	A Toolkit for Ring-LWE Cryptography. EUROCRYPT Vadim Lyubashevsky, Chris Peikert, Oded Regev
2013	J	`jnl`	A Toolkit for Ring-LWE Cryptography. IACR Cryptol. ePrint Arch. Vadim Lyubashevsky, Chris Peikert, Oded Regev
2013	J	`jnl`	Classical Hardness of Learning with Errors. CoRR Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, Damien Stehlé
2013	A*	`conf`	Classical hardness of learning with errors. STOC Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, Damien Stehlé
2013	A*	`conf`	Efficient rounding for the noncommutative grothendieck inequality. STOC Assaf Naor, Oded Regev, Thomas Vidick
2013	J	`jnl`	On Ideal Lattices and Learning with Errors over Rings. J. ACM Vadim Lyubashevsky, Chris Peikert, Oded Regev
2013	J	`jnl`	On the Lattice Isomorphism Problem. CoRR Ishay Haviv, Oded Regev
2013	A	`conf`	Quantum XOR Games. CCC Oded Regev, Thomas Vidick
2012	J	`jnl`	An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance. SIAM J. Comput. Amit Chakrabarti, Oded Regev
2012	J	`jnl`	Bell violations through independent bases games. Quantum Inf. Comput. Oded Regev
2012	J	`jnl`	Efficient rounding for the noncommutative Grothendieck inequality CoRR Assaf Naor, Oded Regev, Thomas Vidick
2012	J	`jnl`	Hardness of the Covering Radius Problem on Lattices. Chic. J. Theor. Comput. Sci. Ishay Haviv, Oded Regev
2012	J	`jnl`	Locally decodable codes and the failure of cotype for projective tensor products CoRR Jop Briët, Assaf Naor, Oded Regev
2012	J	`jnl`	Near-Optimal and Explicit Bell Inequality Violations. Theory Comput. Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf
2012	J	`jnl`	On Ideal Lattices and Learning with Errors Over Rings. IACR Cryptol. ePrint Arch. Vadim Lyubashevsky, Chris Peikert, Oded Regev
2012	J	`jnl`	Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors. Theory Comput. Ishay Haviv, Oded Regev
2011	A*	`conf`	An optimal lower bound on the communication complexity of gap-hamming-distance. STOC Amit Chakrabarti, Oded Regev
2011	A	`conf`	Near-Optimal and Explicit Bell Inequality Violations. CCC Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf
2011	A*	`conf`	Quantum one-way communication can be exponentially stronger than classical communication. STOC Oded Regev, Bo'az Klartag
2010	J	`jnl`	An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance CoRR Amit Chakrabarti, Oded Regev
2010	J	`jnl`	An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance. Electron. Colloquium Comput. Complex. Amit Chakrabarti, Oded Regev
2010	J	`jnl`	An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching. SIAM J. Comput. Amit Chakrabarti, Oded Regev
2010	—	`conf`	Better Gap-Hamming Lower Bounds via Better Round Elimination. APPROX-RANDOM Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf
2010	A*	`conf`	Lattice Enumeration Using Extreme Pruning. EUROCRYPT Nicolas Gama, Phong Q. Nguyen, Oded Regev
2010	—	`conf`	Learning with Errors over Rings. ANTS Oded Regev
2010	A	`conf`	No Strong Parallel Repetition with Entangled and Non-signaling Provers. CCC Julia Kempe, Oded Regev
2010	A*	`conf`	On Ideal Lattices and Learning with Errors over Rings. EUROCRYPT Vadim Lyubashevsky, Chris Peikert, Oded Regev
2010	—	`ch.`	On the Complexity of Lattice Problems with Polynomial Approximation Factors. The LLL Algorithm Oded Regev
2010	J	`jnl`	Quantum One-Way Communication is Exponentially Stronger Than Classical Communication CoRR Bo'az Klartag, Oded Regev
2010	J	`jnl`	Quantum One-Way Communication is Exponentially Stronger Than Classical Communication. Electron. Colloquium Comput. Complex. Bo'az Klartag, Oded Regev
2010	—	`conf`	The Euclidean Distortion of Flat Tori. APPROX-RANDOM Ishay Haviv, Oded Regev
2010	A	`conf`	The Learning with Errors Problem (Invited Survey). CCC Oded Regev
2010	J	`jnl`	Unique Games with Entangled Provers Are Easy. SIAM J. Comput. Julia Kempe, Oded Regev, Ben Toner
2010	J	`jnl`	Upper bounds on the noise threshold for fault-tolerant quantum computing. Quantum Inf. Comput. Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf
2009	J	`jnl`	A Note on the Distribution of the Distance from a Lattice. Discret. Comput. Geom. Ishay Haviv, Vadim Lyubashevsky, Oded Regev
2009	J	`jnl`	Better Gap-Hamming Lower Bounds via Better Round Elimination CoRR Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf
2009	J	`jnl`	Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity. SIAM J. Comput. Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf
2009	J	`jnl`	Conditional Hardness for Approximate Coloring. SIAM J. Comput. Irit Dinur, Elchanan Mossel, Oded Regev
2009	J	`jnl`	Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures. J. Cryptol. Phong Q. Nguyen, Oded Regev
2009	J	`jnl`	No Strong Parallel Repetition with Entangled and Non-signaling Provers CoRR Julia Kempe, Oded Regev
2009	J	`jnl`	On lattices, learning with errors, random linear codes, and cryptography. J. ACM Oded Regev
2009	J	`jnl`	Simulating Quantum Correlations with Finite Communication. SIAM J. Comput. Oded Regev, Ben Toner
2008	A*	`conf`	A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs. FOCS Avraham Ben-Aroya, Oded Regev, Ronald de Wolf
2008	J	`jnl`	Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation. SIAM Rev. Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev
2008	—	`conf`	Impossibility of a Quantum Speed-Up with a Faulty Oracle. ICALP (1) Oded Regev, Liron Schiff
2008	—	`conf`	Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete. ICALP (1) Lior Eldar, Oded Regev
2008	A*	`conf`	Rounding Parallel Repetitions of Unique Games. FOCS Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer
2008	J	`jnl`	Simultaneous Communication Protocols with Quantum and Classical Messages. Chic. J. Theor. Comput. Sci. Dmitry Gavinsky, Oded Regev, Ronald de Wolf
2008	A*	`conf`	Unique Games with Entangled Provers are Easy. FOCS Julia Kempe, Oded Regev, Ben Toner
2008	—	`conf`	Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. ICALP (1) Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf
2008	J	`jnl`	Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci. Subhash Khot, Oded Regev
2007	J	`jnl`	Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. SIAM J. Comput. Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev
2007	J	`jnl`	On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. Theory Comput. Ishay Haviv, Oded Regev, Amnon Ta-Shma
2007	A*	`conf`	Simulating Quantum Correlations with Finite Communication. FOCS Oded Regev, Ben Toner
2007	A*	`conf`	Tensor-based hardness of the shortest vector problem to within almost polynomial factors. STOC Ishay Haviv, Oded Regev
2007	—	`conf`	The Unique Games Conjecture with Entangled Provers is False. Algebraic Methods in Computational Complexity Julia Kempe, Oded Regev, Ben Toner
2007	J	`jnl`	Worst-Case to Average-Case Reductions Based on Gaussian Measures. SIAM J. Comput. Daniele Micciancio, Oded Regev
2006	A*	`conf`	Bounded-error quantum state identification and exponential separations in communication complexity. STOC Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf
2006	J	`jnl`	Combinatorial Algorithms for the Unsplittable Flow Problem. Algorithmica Yossi Azar, Oded Regev
2006	A*	`conf`	Conditional hardness for approximate coloring. STOC Irit Dinur, Elchanan Mossel, Oded Regev
2006	A	`conf`	Hardness of the Covering Radius Problem on Lattices. CCC Ishay Haviv, Oded Regev
2006	A*	`conf`	Lattice problems and norm embeddings. STOC Oded Regev, Ricky Rosen
2006	A*	`conf`	Lattice-Based Cryptography. CRYPTO Oded Regev
2006	A*	`conf`	Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures. EUROCRYPT Phong Q. Nguyen, Oded Regev
2006	J	`jnl`	The Complexity of the Local Hamiltonian Problem. SIAM J. Comput. Julia Kempe, Alexei Y. Kitaev, Oded Regev
2005	J	`jnl`	A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. SIAM J. Comput. Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
2005	J	`jnl`	Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity CoRR Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf
2005	J	`jnl`	Conditional Hardness for Approximate Coloring CoRR Irit Dinur, Elchanan Mossel, Oded Regev
2005	J	`jnl`	Conditional Hardness for Approximate Coloring Electron. Colloquium Comput. Complex. Irit Dinur, Elchanan Mossel, Oded Regev
2005	J	`jnl`	Lattice problems in NP cap coNP. J. ACM Dorit Aharonov, Oded Regev
2005	A*	`conf`	On lattices, learning with errors, random linear codes, and cryptography. STOC Oded Regev
2005	J	`jnl`	The Hardness of 3-Uniform Hypergraph Coloring. Comb. Irit Dinur, Oded Regev, Clifford D. Smyth
2005	J	`jnl`	The complexity of the covering radius problem. Comput. Complex. Venkatesan Guruswami, Daniele Micciancio, Oded Regev
2004	A*	`conf`	Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. FOCS Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev
2004	A*	`conf`	An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching. FOCS Amit Chakrabarti, Oded Regev
2004	J	`jnl`	Improved Inapproximability of Lattice and Coding Problems With Preprocessing. IEEE Trans. Inf. Theory Oded Regev
2004	A*	`conf`	Lattice Problems in NP cap coNP. FOCS Dorit Aharonov, Oded Regev
2004	J	`jnl`	Long Monotone Paths in Line Arrangements. Discret. Comput. Geom. József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy
2004	J	`jnl`	New lattice-based cryptographic constructions. J. ACM Oded Regev
2004	J	`jnl`	Quantum Computation and Lattice Problems. SIAM J. Comput. Oded Regev
2004	A	`conf`	The Complexity of the Covering Radius Problem on Lattices and Codes. CCC Venkatesan Guruswami, Daniele Micciancio, Oded Regev
2004	J	`jnl`	The Complexity of the Local Hamiltonian Problem CoRR Julia Kempe, Alexei Y. Kitaev, Oded Regev
2004	—	`conf`	The Complexity of the Local Hamiltonian Problem. FSTTCS Julia Kempe, Alexei Y. Kitaev, Oded Regev
2004	A*	`conf`	Worst-Case to Average-Case Reductions Based on Gaussian Measures. FOCS Daniele Micciancio, Oded Regev
2003	J	`jnl`	3-local Hamiltonian is QMA-complete. Quantum Inf. Comput. Julia Kempe, Oded Regev
2003	A*	`conf`	A Lattice Problem in Quantum NP. FOCS Dorit Aharonov, Oded Regev
2003	J	`jnl`	A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover CoRR Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
2003	A*	`conf`	A new multilayered PCP and the hardness of hypergraph vertex cover. STOC Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
2003	J	`jnl`	An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching Electron. Colloquium Comput. Complex. Amit Chakrabarti, Oded Regev
2003	A	`conf`	Improved Inapproximability of Lattice and Coding Problems with Preprocessing. CCC Oded Regev
2003	—	`conf`	Long monotone paths in line arrangements. SCG József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy
2003	J	`jnl`	New Lattice Based Cryptographic Constructions CoRR Oded Regev
2003	A*	`conf`	New lattice based cryptographic constructions. STOC Oded Regev
2003	J	`jnl`	On-line restricted assignment of temporary tasks with unknown durations. Inf. Process. Lett. Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev
2003	J	`jnl`	Quantum Computation and Lattice Problems CoRR Oded Regev
2003	A	`conf`	Vertex Cover Might be Hard to Approximate to within 2-\varepsilon. CCC Subhash Khot, Oded Regev
2002	J	`jnl`	Minimizing the Flow Time Without Migration. SIAM J. Comput. Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev
2002	J	`jnl`	Off-line temporary tasks assignment. Theor. Comput. Sci. Yossi Azar, Oded Regev, Jirí Sgall, Gerhard J. Woeginger
2002	J	`jnl`	Priority algorithms for makespan minimization in the subset model. Inf. Process. Lett. Oded Regev
2002	A*	`conf`	Quantum Computation and Lattice Problems. FOCS Oded Regev
2002	A*	`conf`	Temporary tasks assignment resolved. SODA Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev
2002	A*	`conf`	The Hardness of 3 - Uniform Hypergraph Coloring. FOCS Irit Dinur, Oded Regev, Clifford D. Smyth
2001	J	`jnl`	On-line bin-stretching. Theor. Comput. Sci. Yossi Azar, Oded Regev
2001	—	`—`	Scheduling and load balancing Oded Regev
2001	B	`conf`	Strongly Polynomial Algorithms for the Unsplittable Flow Problem. IPCO Yossi Azar, Oded Regev
2000	—	`conf`	Maximizing job benefits on-line. APPROX Baruch Awerbuch, Yossi Azar, Oded Regev
1999	A*	`conf`	Minimizing the Flow Time Without Migration. STOC Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev
1999	A	`conf`	Off-Line Temporary Tasks Assignment. ESA Yossi Azar, Oded Regev
1998	A	`conf`	Globally Distributed Computation over the Internet - The POPCORN Project. ICDCS Noam Nisan, Shmulik London, Oded Regev, Noam Camiel
1998	—	`conf`	On-Line Bin-Stretching. RANDOM Yossi Azar, Oded Regev