- BoundedError Quantum State Identification and Exponential Separations in Communication Complexity
- The Hardness of 3Uniform Hypergraph Coloring Irit Dinur # Oded Regev + Cli#ord Smyth #
- Minimizing the Flow Time without Migration
- Combinatorial Algorithms for the Unsplittable Flow Yossi Azar
- On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy
- Worst-case to Average-case Reductions based on Gaussian Measures Daniele Micciancio
- Worstcase to Averagecase Reductions based on Gaussian Measures # Daniele Micciancio + Oded Regev #
- Boolean functions with low average sensitivity depend on few coordinates
- New Lattice Based Cryptographic Constructions Oded Regev #
- The Learning with Errors Problem In this survey we describe the Learning with Errors (LWE) problem, discuss its properties,
- The Euclidean Distortion of Flat Tori Ishay Haviv
- Simultaneous Communication Protocols with Quantum and Classical Messages
- On the Complexity of Lattice Problems with Polynomial Approximation Factors
- Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors
- A preliminary version appeared in the Proceedings of EUROCRYPT '06 Learning a Parallelepiped
- Lattice Problems and Norm Embeddings Oded Regev
- Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity
- Conditional Hardness for Approximate Coloring Elchanan Mossel
- On Lattices, Learning with Errors, Random Linear Codes, and Cryptography
- Lattice Problems in NP coNP Dorit Aharonov
- An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
- Improved Inapproximability of Lattice and Coding Problems with Preprocessing
- Long Monotone Paths in Line Arrangements Jozsef Balogh
- The Hardness of 3-Uniform Hypergraph Coloring Irit Dinur
- On-line Bin-Stretching Yossi Azar y Oded Regevz
- Temporary Tasks Assignment Resolved Amitai Armon y Yossi Azar z Leah Epstein x Oded Regev {
- O -line Temporary Tasks Assignment Yossi Azar y Oded Regev z Ji r Sgall x
- QUANTUM COMPUTATION AND LATTICE PROBLEMS ODED REGEV
- Latticebased Cryptography Oded Regev #
- QUANTUM COMPUTATION AND LATTICE PROBLEMS # ODED REGEV +
- Vertex Cover Might be Hard to Approximate to within 2 -#
- OnLine Restricted Assignment of Temporary Tasks with Unknown Amitai Armon # Yossi Azar + Leah Epstein # Oded Regev
- Hardness of the Covering Radius Problem on Lattices Ishay Haviv # Oded Regev +
- Long Monotone Paths in Line Arrangements Jozsef Balogh # Oded Regev + Cli#ord Smyth # William Steiger
- On the Complexity of Lattice Problems with Polynomial Approximation Factors
- Improved Inapproximability of Lattice and Coding Problems with Preprocessing
- Maximizing Job Bene ts On-line Baruch Awerbuch y Yossi Azar z Oded Regev x
- Boolean Functions whose Fourier Transform is Concentrated on the First Two Levels
- Noninteractive correlation distillation, inhomogeneous Markov chains, and the reverse
- Hardness of the Covering Radius Problem on Lattices Ishay Haviv
- Lattice Problems in NP # coNP Dorit Aharonov # Oded Regev +
- Impossibility of a Quantum Speed-up with a Faulty Oracle Oded Regev Liron Schiff
- Lattice-based Cryptography Tel Aviv University, Israel
- New Lattice Based Cryptographic Constructions Oded Regev
- A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
- On the Hardness of Satisfiability with Bounded Occurrences in the PolynomialTime Hierarchy
- Tensorbased Hardness of the Shortest Vector Problem to within Almost Polynomial Factors
- Combinatorial Algorithms for the Unsplittable Flow Yossi Azar + Oded Regev #
- Subspace Polynomials and List Decoding of ReedSolomon Codes Eli BenSasson #
- Independent Sets in Graph Powers are Almost Contained in Irit Dinur # Ehud Friedgut + Oded Regev #
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse
- On-Line Restricted Assignment of Temporary Tasks with Unknown Amitai Armon
- Lattice Problems and Norm Embeddings Oded Regev # Ricky Rosen +
- Priority Algorithms for Makespan Minimization in the Subset Model
- Lattice-based Cryptography Daniele Micciancio
- Independent Sets in Graph Powers are Almost Contained in Irit Dinur
