| Publication | Date of Publication | Type |
|---|
| Locally testable codes with constant rate, distance, and locality | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6054745 | 2023-10-25 | Paper |
| New Codes on High Dimensional Expanders | 2023-08-29 | Paper |
| Coboundary and cosystolic expansion without dependence on dimension or degree | 2023-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875496 | 2023-02-03 | Paper |
| Bipartite unique-neighbour expanders via Ramanujan graphs | 2023-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5093398 | 2022-07-26 | Paper |
| Good Locally Testable Codes | 2022-07-25 | Paper |
| From Local to Robust Testing via Agreement Testing | 2022-07-18 | Paper |
| Every Set in P Is Strongly Testable Under a Suitable Encoding | 2022-07-18 | Paper |
| Near coverings and cosystolic expansion | 2022-05-10 | Paper |
| On non-optimally expanding sets in Grassmann graphs | 2021-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009534 | 2021-08-04 | Paper |
| ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network | 2021-06-15 | Paper |
| List-Decoding with Double Samplers | 2021-03-24 | Paper |
| Explicit SoS lower bounds from high-dimensional expanders | 2020-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111160 | 2020-05-26 | Paper |
| Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract] | 2019-10-15 | Paper |
| List Decoding with Double Samplers | 2019-10-15 | Paper |
| Near Coverings and Cosystolic Expansion -- an example of topological property testing | 2019-09-18 | Paper |
| Towards a proof of the 2-to-1 games conjecture? | 2019-08-22 | Paper |
| On non-optimally expanding sets in Grassmann graphs | 2019-08-22 | Paper |
| Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity | 2018-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4638090 | 2018-05-03 | Paper |
| Cube vs. Cube Low Degree Test. | 2018-05-03 | Paper |
| Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity | 2017-10-10 | Paper |
| Direct Sum Testing | 2017-08-16 | Paper |
| The Computational Benefit of Correlated Instances | 2017-05-19 | Paper |
| Direct Sum Testing | 2017-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2955002 | 2017-01-24 | Paper |
| PCP characterizations of NP | 2016-09-29 | Paper |
| PCPs via the low-degree long code and hardness for constrained hypergraph coloring | 2015-11-16 | Paper |
| Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition | 2015-08-21 | Paper |
| Analytical approach to parallel repetition | 2015-06-26 | Paper |
| A parallel repetition theorem for entangled projection games | 2015-06-23 | Paper |
| Conditional hardness for approximate coloring | 2014-11-25 | Paper |
| On the fourier tails of bounded functions over the discrete cube | 2014-11-25 | Paper |
| The PCP theorem by gap amplification | 2014-11-25 | Paper |
| Composition of Low-Error 2-Query PCPs Using Decodable PCPs | 2014-07-25 | Paper |
| Composition of Low-Error 2-Query PCPs Using Decodable PCPs | 2014-04-11 | Paper |
| Clustering in the Boolean Hypercube in a List Decoding Regime | 2013-08-06 | Paper |
| PCP characterizations of NP: toward a polynomially-small error-probability | 2011-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3096563 | 2011-11-11 | Paper |
| Derandomized parallel repetition via structured PCPs | 2011-11-08 | Paper |
| Dense Locally Testable Codes Cannot Have Constant Rate and Distance | 2011-08-17 | Paper |
| Composition of Low-Error 2-Query PCPs Using Decodable PCPs | 2010-10-12 | Paper |
| On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors | 2010-09-10 | Paper |
| The Structure of Winning Strategies in Parallel Repetition Games | 2010-09-10 | Paper |
| A new multilayered PCP and the hardness of hypergraph vertex cover | 2010-08-16 | Paper |
| The importance of being biased | 2010-08-05 | Paper |
| Conditional Hardness for Approximate Coloring | 2010-07-07 | Paper |
| Intersecting Families are Essentially Contained in Juntas | 2010-04-23 | Paper |
| On the hardness of approximating label-cover | 2009-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549711 | 2009-01-05 | Paper |
| The PCP theorem by gap amplification | 2008-12-21 | Paper |
| Independent sets in graph powers are almost contained in juntas | 2008-05-14 | Paper |
| On the Fourier tails of bounded functions over the discrete cube | 2008-04-01 | Paper |
| Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem | 2007-09-07 | Paper |
| Robust Local Testability of Tensor Products of LDPC Codes | 2007-08-28 | Paper |
| The hardness of 3-uniform hypergraph coloring | 2007-01-02 | Paper |
| Proof of an intersection theorem via graph homomorphisms | 2006-03-22 | Paper |
| On the hardness of approximating minimum vertex cover | 2006-03-10 | Paper |
| A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover | 2005-09-16 | Paper |
| Graph products, Fourier analysis and spectral techniques | 2005-02-24 | Paper |
| Approximating CVP to within almost-polynomial factors is NP-hard | 2004-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503941 | 2002-12-15 | Paper |
| Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard | 2002-08-05 | Paper |
