| Publication | Date of Publication | Type |
|---|
| Criticality of AC\(^0\)-formulae | 2024-11-19 | Paper |
| Downward self-reducibility in TFNP | 2024-09-25 | Paper |
| Sparse juntas on the biased hypercube | 2024-08-13 | Paper |
| Ideal-theoretic explanation of capacity-achieving decoding | 2024-07-22 | Paper |
| Decoding multivariate multiplicity codes on product sets | 2024-07-21 | Paper |
| Vanishing spaces of random sets and applications to Reed-Muller codes | 2024-07-05 | Paper |
| Boolean function analysis on high-dimensional expanders | 2024-05-31 | Paper |
| Rigid matrices from rectangular PCPs | 2024-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126246 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6090914 | 2023-11-20 | Paper |
| Decoding multivariate multiplicity codes on product sets | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6062153 | 2023-10-31 | Paper |
| On the probabilistic degree of OR over the reals | 2023-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875460 | 2023-02-03 | Paper |
| From local to robust testing via agreement testing | 2022-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090936 | 2022-07-21 | Paper |
| From Local to Robust Testing via Agreement Testing | 2022-07-18 | Paper |
| Algorithmizing the Multiplicity Schwartz-Zippel Lemma | 2021-11-22 | Paper |
| Boolean function analysis on high-dimensional expanders | 2021-08-04 | Paper |
| A characterization of hard-to-cover CSPs | 2021-04-01 | Paper |
| List-Decoding with Double Samplers | 2021-03-24 | Paper |
| Explicit SoS lower bounds from high-dimensional expanders | 2020-09-10 | Paper |
| A note on the elementary construction of High-Dimensional Expanders of Kaufman and Oppenheim | 2019-12-24 | Paper |
| Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests | 2019-10-15 | Paper |
| List decoding with double samplers | 2019-10-15 | Paper |
| On polynomial approximations to \(\mathrm{AC}^0\) | 2019-05-02 | Paper |
| Robust Multiplication-Based Tests for Reed–Muller Codes | 2019-01-18 | Paper |
| Multiplayer parallel repetition for expanding games | 2018-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636465 | 2018-04-19 | Paper |
| Embedding approximately low-dimensional \(\ell_2^2\) metrics into \(\ell_1\) | 2018-04-19 | Paper |
| Robust multiplication-based tests for Reed-Muller codes | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636610 | 2018-04-19 | Paper |
| A characterization of hard-to-cover CSPs | 2018-01-24 | Paper |
| Partition bound is quadratically tight for product distributions | 2017-12-19 | Paper |
| The Communication Complexity of Correlation | 2017-07-27 | Paper |
| Super-polylogarithmic hypergraph coloring hardness via low-degree long codes | 2017-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2963906 | 2017-02-21 | Paper |
| Derandomized graph product results using the low degree long code | 2017-01-24 | Paper |
| Sound 3-query PCPPs are long | 2015-09-24 | Paper |
| Lower bounds for bounded depth Frege proofs via Pudlák-Buss games | 2015-09-17 | Paper |
| Polynomially low error PCPs with \(\operatorname{polyloglog} n\) queries via modular composition | 2015-08-21 | Paper |
| Super-polylogarithmic hypergraph coloring hardness via low-degree long codes | 2015-06-26 | Paper |
| Distributed processing in automata | 2015-04-29 | Paper |
| Bounding the sensitivity of polynomial threshold functions | 2014-10-06 | Paper |
| Bounding the average sensitivity and noise sensitivity of polynomial threshold functions | 2014-08-13 | Paper |
| An invariance principle for polytopes | 2014-08-13 | Paper |
| Composition of Low-Error 2-Query PCPs Using Decodable PCPs | 2014-07-25 | Paper |
| Almost settling the hardness of noncommutative determinant | 2014-06-05 | Paper |
| Composition of low-error 2-query PCPs using decodable PCPs | 2014-04-11 | Paper |
| An invariance principle for polytopes | 2014-02-17 | Paper |
| Composition of low-error 2-query PCPs using decodable PCPs | 2010-10-12 | Paper |
| Some 3CNF properties are hard to test | 2010-08-16 | Paper |
| Robust PSPs of proximity, shorter PSPs and applications to coding | 2010-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579444 | 2010-08-06 | Paper |
| Sound 3-Query PCPPs Are Long | 2008-08-28 | Paper |
| Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding | 2007-09-07 | Paper |
| Some 3CNF Properties Are Hard to Test | 2005-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762515 | 2002-01-09 | Paper |
| Small PCPs with low query complexity | 2001-10-14 | Paper |
| Boolean functions on high-dimensional expanders | N/A | Paper |
| Sparse juntas on the biased hypercube | N/A | Paper |
