| Publication | Date of Publication | Type |
|---|
| On the Gaussian surface area of spectrahedra | 2024-09-20 | Paper |
| A reverse Minkowski theorem | 2024-01-02 | Paper |
| Bounds on the density of smooth lattice coverings | 2023-11-08 | Paper |
| An integer parallelotope with small surface area | 2023-09-20 | Paper |
| A simple proof of a reverse Minkowski theorem for integral lattices | 2023-06-06 | Paper |
| Polynomial Data Structure Lower Bounds in the Group Model | 2022-04-01 | Paper |
| A Tight Reverse Minkowski Inequality for the Epstein Zeta Function | 2022-01-13 | Paper |
| On the Gaussian surface area of spectrahedra | 2021-12-02 | Paper |
| New bounds on the density of lattice coverings | 2021-11-04 | Paper |
| The minrank of random graphs | 2021-07-28 | Paper |
| Concentration of Markov chains with bounded moments | 2021-02-15 | Paper |
| Bounds on Dimension Reduction in the Nuclear Norm | 2020-08-21 | Paper |
| The List-Decoding Size of Fourier-Sparse Boolean Functions | 2019-12-06 | Paper |
| On the Lattice Isomorphism Problem | 2019-06-20 | Paper |
| Concentration of Markov chains with bounded moments | 2019-06-17 | Paper |
| A counterexample to a strong variant of the Polynomial Freiman-Ruzsa conjecture in Euclidean space | 2019-01-09 | Paper |
| Kneser graphs are like Swiss cheese | 2019-01-09 | Paper |
| The Minrank of Random Graphs | 2018-12-04 | Paper |
| The Restricted Isometry Property of Subsampled Fourier Matrices | 2018-07-16 | Paper |
| Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601822 | 2018-01-24 | Paper |
| Tight Hardness of the Non-commutative Grothendieck Problem | 2018-01-10 | Paper |
| Counterexamples to a conjecture of Woods | 2017-10-24 | Paper |
| Long monotone paths in line arrangements | 2017-09-29 | Paper |
| A reverse Minkowski theorem | 2017-08-17 | Paper |
| Pseudorandomness of ring-LWE for any ring and modulus | 2017-08-17 | Paper |
| The Restricted Isometry Property of Subsampled Fourier Matrices | 2017-07-13 | Paper |
| An Inequality for Gaussians on Lattices | 2017-05-24 | Paper |
| A Sharp Tail Bound for the Expander Random Sampler | 2017-03-29 | Paper |
| Quantum XOR games | 2016-10-24 | Paper |
| Minimizing the flow time without migration | 2016-09-29 | Paper |
| A Note on Koldobsky's Lattice Slicing Inequality | 2016-08-17 | Paper |
| A Note on Discrete Gaussian Combinations of Lattice Vectors | 2016-08-16 | Paper |
| Recovering Short Generators of Principal Ideals in Cyclotomic Rings | 2016-07-15 | Paper |
| Towards Strong Reverse Minkowski-type Inequalities for Lattices | 2016-06-22 | Paper |
| A counterexample to monotonicity of relative mass in random walks | 2016-05-23 | Paper |
| On the space complexity of linear programming with preprocessing | 2016-04-15 | Paper |
| On lattices, learning with errors, random linear codes, and cryptography | 2015-11-11 | Paper |
| Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling | 2015-08-21 | Paper |
| Lattice problems and norm embeddings | 2014-11-25 | Paper |
| Conditional hardness for approximate coloring | 2014-11-25 | Paper |
| Bounded-error quantum state identification and exponential separations in communication complexity | 2014-11-25 | Paper |
| Krivine schemes are optimal | 2014-11-19 | Paper |
| Near-Optimal and Explicit Bell Inequality Violations | 2014-10-06 | Paper |
| Efficient Rounding for the Noncommutative Grothendieck Inequality | 2014-10-06 | Paper |
| Classical hardness of learning with errors | 2014-08-07 | Paper |
| Efficient rounding for the noncommutative grothendieck inequality | 2014-08-07 | Paper |
| Elementary proofs of Grothendieck theorems for completely bounded norms | 2014-07-14 | Paper |
| An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance | 2014-06-05 | Paper |
| Quantum one-way communication can be exponentially stronger than classical communication | 2014-06-05 | Paper |
| On the Lattice Isomorphism Problem | 2014-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414570 | 2014-05-06 | Paper |
| On Ideal Lattices and Learning with Errors over Rings | 2014-02-17 | Paper |
| Entropy-based bounds on dimension reduction in \(L^1\) | 2013-10-31 | Paper |
| The Restricted Isometry Property of Subsampled Fourier Matrices | 2013-06-27 | Paper |
| A Toolkit for Ring-LWE Cryptography | 2013-05-31 | Paper |
| An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance | 2013-02-04 | Paper |
| Locally decodable codes and the failure of cotype for projective tensor products | 2012-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3166191 | 2012-10-21 | Paper |
| Tensor-based hardness of the shortest vector problem to within almost polynomial factors | 2012-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3171599 | 2011-10-05 | Paper |
| On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy | 2011-05-24 | Paper |
| Unique Games with Entangled Provers Are Easy | 2011-04-04 | Paper |
| An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching | 2010-11-04 | Paper |
| Learning with Errors over Rings | 2010-09-29 | Paper |
| The Euclidean Distortion of Flat Tori | 2010-09-10 | Paper |
| Better Gap-Hamming Lower Bounds via Better Round Elimination | 2010-09-10 | Paper |
| Simulating Quantum Correlations with Finite Communication | 2010-09-06 | Paper |
| On lattices, learning with errors, random linear codes, and cryptography | 2010-08-16 | Paper |
| A new multilayered PCP and the hardness of hypergraph vertex cover | 2010-08-16 | Paper |
| New lattice based cryptographic constructions | 2010-08-16 | Paper |
| Conditional Hardness for Approximate Coloring | 2010-07-07 | Paper |
| On Ideal Lattices and Learning with Errors over Rings | 2010-06-01 | Paper |
| Lattice Enumeration Using Extreme Pruning | 2010-06-01 | Paper |
| Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity | 2010-03-17 | Paper |
| On the Complexity of Lattice Problems with Polynomial Approximation Factors | 2010-03-05 | Paper |
| Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures | 2009-05-08 | Paper |
| A note on the distribution of the distance from a lattice | 2009-03-24 | Paper |
| Lattice-based Cryptography | 2009-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549646 | 2009-01-05 | Paper |
| Lattice problems in NP ∩ coNP | 2008-12-21 | Paper |
| Improved Inapproximability of Lattice and Coding Problems With Preprocessing | 2008-12-21 | Paper |
| Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation | 2008-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3522439 | 2008-09-03 | Paper |
| Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing | 2008-08-28 | Paper |
| Impossibility of a Quantum Speed-Up with a Faulty Oracle | 2008-08-28 | Paper |
| Quantum SAT for a Qutrit-Cinquit Pair Is QMA 1-Complete | 2008-08-28 | Paper |
| Independent sets in graph powers are almost contained in juntas | 2008-05-14 | Paper |
| Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation | 2008-03-28 | Paper |
| Worst‐Case to Average‐Case Reductions Based on Gaussian Measures | 2008-03-28 | Paper |
| Vertex cover might be hard to approximate to within \(2 - \varepsilon \) | 2008-03-11 | Paper |
| Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality | 2008-02-22 | Paper |
| New lattice-based cryptographic constructions | 2008-01-14 | Paper |
| Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures | 2007-09-24 | Paper |
| Lattice-Based Cryptography | 2007-09-04 | Paper |
| The hardness of 3-uniform hypergraph coloring | 2007-01-02 | Paper |
| Combinatorial algorithms for the unsplittable flow problem | 2006-06-14 | Paper |
| The Complexity of the Local Hamiltonian Problem | 2006-06-01 | Paper |
| The complexity of the covering radius problem | 2006-02-07 | Paper |
| A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover | 2005-09-16 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| Quantum Computation and Lattice Problems | 2005-02-21 | Paper |
| Long monotone paths in line arrangements | 2005-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828923 | 2004-11-29 | Paper |
| Temporary tasks assignment resolved | 2003-08-17 | Paper |
| Priority algorithms for makespan minimization in the subset model. | 2003-01-21 | Paper |
| On-line restricted assignment of temporary tasks with unknown durations. | 2003-01-21 | Paper |
| Off-line temporary tasks assignment. | 2003-01-21 | Paper |
| Minimizing the Flow Time Without Migration | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537731 | 2002-06-20 | Paper |
| Maximizing job benefits on-line | 2002-05-14 | Paper |
| On-line bin-stretching | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753725 | 2001-11-11 | Paper |
