| Publication | Date of Publication | Type |
|---|
| High-dimensional expanders from Chevalley groups | 2024-07-05 | Paper |
| Improved quantum data analysis | 2024-07-03 | Paper |
| The SDP value of random 2CSPs | 2024-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126329 | 2024-04-09 | Paper |
| Optimizing strongly interacting fermionic Hamiltonians | 2023-12-08 | Paper |
| Fiber bundle codes: breaking the n 1/2 polylog( n ) barrier for Quantum LDPC codes | 2023-11-14 | Paper |
| Improved Quantum data analysis | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6161149 | 2023-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874325 | 2023-02-07 | Paper |
| Lower bounds for testing complete positivity and quantum separability | 2022-10-13 | Paper |
| Mean estimation when you have the source code; or, quantum Monte Carlo methods | 2022-08-16 | Paper |
| Sherali-adams strikes back | 2022-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090410 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090427 | 2022-07-18 | Paper |
| Fooling Polytopes | 2022-03-31 | Paper |
| Log-Sobolev inequality for the multislice, with applications | 2022-03-30 | Paper |
| High-Dimensional Expanders from Chevalley Groups | 2022-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5158503 | 2021-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009552 | 2021-08-04 | Paper |
| The SDP value of random 2CSPs | 2021-08-02 | Paper |
| Explicit Near-Ramanujan Graphs of Every Degree | 2021-03-24 | Paper |
| The Quantum Union Bound made easy | 2021-03-13 | Paper |
| X-Ramanujan graphs | 2021-02-02 | Paper |
| Explicit near-Ramanujan graphs of every degree | 2021-01-19 | Paper |
| Fooling Gaussian PTFs via local hyperconcentration | 2021-01-19 | Paper |
| Sharp bounds for population recovery | 2020-12-17 | Paper |
| Explicit near-fully X-Ramanujan graphs | 2020-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111344 | 2020-05-27 | Paper |
| Fooling polytopes | 2020-01-30 | Paper |
| The Weakness of CTC Qubits and the Power of Approximate Counting | 2019-12-06 | Paper |
| The threshold for SDP-refutation of random regular NAE-3SAT | 2019-10-15 | Paper |
| Testing Surface Area | 2019-06-20 | Paper |
| Hypercontractive inequalities via SOS, and the Frankl–Rödl graph | 2019-06-20 | Paper |
| The SDP value for random two-eigenvalue CSPs | 2019-06-16 | Paper |
| Approximability and proof complexity | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633833 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633845 | 2019-05-06 | Paper |
| Optimal mean-based algorithms for trace reconstruction | 2019-04-24 | Paper |
| $X$-Ramanujan Graphs | 2019-04-06 | Paper |
| Gaussian noise sensitivity and Fourier tails | 2018-06-29 | Paper |
| SOS Is Not Obviously Automatizable, Even Approximately | 2018-05-03 | Paper |
| Social choice, computational complexity, Gaussian geometry, and Boolean functions | 2017-11-06 | Paper |
| Polynomial bounds for decoupling, with applications | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365141 | 2017-09-29 | Paper |
| Sum of squares lower bounds for refuting any CSP | 2017-08-17 | Paper |
| Optimal mean-based algorithms for trace reconstruction | 2017-08-17 | Paper |
| One Time-traveling Bit is as Good as Logarithmically Many | 2017-04-25 | Paper |
| Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups | 2016-10-24 | Paper |
| Hypercontractive inequalities via SOS, and the Frankl--Rödl graph | 2016-10-10 | Paper |
| Linear programming, width-1 CSPs, and robust satisfaction | 2016-10-07 | Paper |
| Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs | 2016-08-08 | Paper |
| Algorithmic Signaling of Features in Auction Design | 2015-11-04 | Paper |
| Optimal Bounds for Estimating Entropy with PMF Queries | 2015-09-16 | Paper |
| Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny) | 2015-09-07 | Paper |
| Conditional hardness for satisfiable 3-CSPs | 2015-02-04 | Paper |
| On the fourier tails of bounded functions over the discrete cube | 2014-11-25 | Paper |
| Sharpness of KKL on Schreier graphs | 2014-09-22 | Paper |
| KKL, Kruskal-Katona, and Monotone Nets | 2014-07-25 | Paper |
| Conditioning and covariance on caterpillars | 2014-07-16 | Paper |
| Analysis of Boolean Functions | 2014-07-09 | Paper |
| Pareto Optimal Solutions for Smoothed Analysts | 2014-06-05 | Paper |
| KKL, Kruskal--Katona, and Monotone Nets | 2014-04-11 | Paper |
| A Composition Theorem for the Fourier Entropy-Influence Conjecture | 2013-08-06 | Paper |
| Pareto Optimal Solutions for Smoothed Analysts | 2013-02-04 | Paper |
| Open Problems in Analysis of Boolean Functions | 2012-04-28 | Paper |
| New degree bounds for polynomial threshold functions | 2011-12-19 | Paper |
| Testing Fourier Dimensionality and Sparsity | 2011-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002802 | 2011-05-24 | Paper |
| The Chow Parameters Problem | 2011-05-17 | Paper |
| Testing Halfspaces | 2010-11-04 | Paper |
| Testing (Subclasses of) Halfspaces | 2010-10-12 | Paper |
| Polynomial regression under arbitrary product distributions | 2010-10-07 | Paper |
| SDP Gaps for 2-to-1 and Other Label-Cover Variants | 2010-09-07 | Paper |
| Learning juntas | 2010-08-16 | Paper |
| New degree bounds for polynomial threshold functions | 2010-08-16 | Paper |
| Hardness amplification within NP | 2010-08-05 | Paper |
| Noise stability of functions with low influences: invariance and optimality | 2010-05-27 | Paper |
| Testing ±1-weight halfspace | 2009-10-28 | Paper |
| Testing Fourier Dimensionality and Sparsity | 2009-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549717 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302075 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302081 | 2009-01-05 | Paper |
| Learning Mixtures of Product Distributions over Discrete Domains | 2008-10-28 | Paper |
| Eliminating Cycles in the Discrete Torus | 2008-09-18 | Paper |
| Learning Monotone Decision Trees in Polynomial Time | 2008-06-19 | Paper |
| Eliminating cycles in the discrete torus | 2008-04-23 | Paper |
| On the Fourier tails of bounded functions over the discrete cube | 2008-04-01 | Paper |
| Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? | 2008-03-28 | Paper |
| Extremal properties of polynomial threshold functions | 2008-03-11 | Paper |
| Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality | 2008-02-22 | Paper |
| Approximation by DNF: Examples and Counterexamples | 2007-11-28 | Paper |
| PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption | 2007-09-14 | Paper |
| Learning DNF from random walks | 2005-10-10 | Paper |
| Coin flipping from a cosmic source: On error correction of truly random bits | 2005-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829005 | 2004-11-29 | Paper |
| Learning functions of \(k\) relevant variables | 2004-11-18 | Paper |
| Hardness amplification within NP | 2004-10-04 | Paper |
| Learning intersections and thresholds of halfspaces | 2004-08-06 | Paper |
| On the noise sensitivity of monotone functions | 2003-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428928 | 2003-09-22 | Paper |
| Pseudorandom Permutations from Random Reversible Circuits | N/A | Paper |
