The following pages link to Oded Regev (Q375694):
Displaying 50 items.
- New lattice based cryptographic constructions (Q3581301) (← links)
- Simulating Quantum Correlations with Finite Communication (Q3586191) (← links)
- The Euclidean Distortion of Flat Tori (Q3588410) (← links)
- Better Gap-Hamming Lower Bounds via Better Round Elimination (Q3588428) (← links)
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures (Q3593101) (← links)
- Lattice-based Cryptography (Q3613268) (← links)
- (Q4537731) (← links)
- The Minrank of Random Graphs (Q4559572) (← links)
- The Restricted Isometry Property of Subsampled Fourier Matrices (Q4575599) (← links)
- Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing (Q4575644) (← links)
- The list-decoding size of Fourier-sparse Boolean functions (Q4601822) (← links)
- Tight Hardness of the Non-commutative Grothendieck Problem (Q4602402) (← links)
- A counterexample to a strong variant of the Polynomial Freiman-Ruzsa conjecture in Euclidean space (Q4645013) (← links)
- Kneser graphs are like Swiss cheese (Q4645027) (← links)
- Quantum Computation and Lattice Problems (Q4651491) (← links)
- (Q4828923) (← links)
- An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance (Q4907584) (← links)
- A Toolkit for Ring-LWE Cryptography (Q4924402) (← links)
- Learning with Errors over Rings (Q4931632) (← links)
- The List-Decoding Size of Fourier-Sparse Boolean Functions (Q4973855) (← links)
- Pseudorandomness of ring-LWE for any ring and modulus (Q4977994) (← links)
- A reverse Minkowski theorem (Q4978036) (← links)
- The minrank of random graphs (Q5002652) (← links)
- Polynomial Data Structure Lower Bounds in the Group Model (Q5067444) (← links)
- Bounds on Dimension Reduction in the Nuclear Norm (Q5115972) (← links)
- New bounds on the density of lattice coverings (Q5163491) (← links)
- Elementary proofs of Grothendieck theorems for completely bounded norms (Q5169833) (← links)
- On the Complexity of Lattice Problems with Polynomial Approximation Factors (Q5188551) (← links)
- Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity (Q5189538) (← links)
- The Restricted Isometry Property of Subsampled Fourier Matrices (Q5278293) (← links)
- A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover (Q5317188) (← links)
- An Inequality for Gaussians on Lattices (Q5346551) (← links)
- Long monotone paths in line arrangements (Q5361614) (← links)
- On the Lattice Isomorphism Problem (Q5383988) (← links)
- Unique Games with Entangled Provers Are Easy (Q5390593) (← links)
- On Ideal Lattices and Learning with Errors over Rings (Q5395738) (← links)
- (Q5414570) (← links)
- On the Lattice Isomorphism Problem (Q5414599) (← links)
- Quantum one-way communication can be exponentially stronger than classical communication (Q5419072) (← links)
- New lattice-based cryptographic constructions (Q5435669) (← links)
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures (Q5454252) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465869) (← links)
- The Complexity of the Local Hamiltonian Problem (Q5470726) (← links)
- Efficient rounding for the noncommutative grothendieck inequality (Q5495777) (← links)
- Classical hardness of learning with errors (Q5495828) (← links)
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings (Q5739215) (← links)
- Lattice-Based Cryptography (Q5756637) (← links)
- On lattices, learning with errors, random linear codes, and cryptography (Q5899512) (← links)
- On lattices, learning with errors, random linear codes, and cryptography (Q5901106) (← links)
- On-line bin-stretching (Q5958712) (← links)
