| Publication | Date of Publication | Type |
|---|
| Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II | 2023-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875697 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090384 | 2022-07-18 | Paper |
| Fast Reed-Solomon Interactive Oracle Proofs of Proximity | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002856 | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121912 | 2020-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111371 | 2020-05-27 | Paper |
| Linear-size constant-query IOPs for delegating computation | 2020-04-30 | Paper |
| Scalable zero knowledge with no trusted setup | 2020-03-09 | Paper |
| Aurora: transparent succinct arguments for R1CS | 2020-02-04 | Paper |
| DEEP-FRI: Sampling outside the box improves soundness | 2019-03-28 | Paper |
| Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity | 2018-08-02 | Paper |
| Zero knowledge protocols from succinct constraint detection | 2018-01-19 | Paper |
| Scalable zero knowledge via cycles of elliptic curves | 2018-01-05 | Paper |
| Sparse affine-invariant linear codes are locally testable | 2017-07-28 | Paper |
| Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes | 2017-07-27 | Paper |
| Computational Integrity with a Public Random String from Quasi-Linear PCPs | 2017-06-23 | Paper |
| Fast reductions from RAMs to delegatable succinct constraint satisfaction problems | 2017-05-16 | Paper |
| Subspace Polynomials and Cyclic Subspace Codes | 2017-04-28 | Paper |
| Interactive Oracle Proofs | 2016-12-22 | Paper |
| Short proofs are narrow—resolution made simple | 2016-09-29 | Paper |
| A combinatorial characterization of smooth LTCs and applications | 2016-09-15 | Paper |
| On Public Key Encryption from Noisy Codewords | 2016-04-13 | Paper |
| Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs | 2016-04-08 | Paper |
| From Affine to Two-Source Extractors via Approximate Duality | 2015-11-18 | Paper |
| Sound 3-Query PCPPs Are Long | 2015-09-24 | Paper |
| Composition of semi-LTCs by two-wise tensor products | 2015-09-21 | Paper |
| Lower bounds for bounded depth Frege proofs via Pudlák-Buss games | 2015-09-17 | Paper |
| An Additive Combinatorics Approach Relating Rank to Communication Complexity | 2015-08-14 | Paper |
| Affine dispersers from subspace polynomials | 2015-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191591 | 2014-10-06 | Paper |
| Space complexity in propositional calculus | 2014-09-26 | Paper |
| Scalable Zero Knowledge via Cycles of Elliptic Curves | 2014-08-07 | Paper |
| On the concrete efficiency of probabilistically-checkable proofs | 2014-08-07 | Paper |
| A new family of locally correctable codes based on degree-lifted algebraic geometry codes | 2014-08-07 | Paper |
| Short PCPs with Projection Queries | 2014-07-01 | Paper |
| Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications | 2014-07-01 | Paper |
| From affine to two-source extractors via approximate duality | 2014-06-05 | Paper |
| SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge | 2013-09-17 | Paper |
| Towards lower bounds on locally testable codes via density arguments | 2012-12-07 | Paper |
| Affine Dispersers from Subspace Polynomials | 2012-11-29 | Paper |
| Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic | 2012-11-02 | Paper |
| Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority | 2012-09-25 | Paper |
| On Sums of Locally Testable Affine Invariant Properties | 2011-08-17 | Paper |
| Limits on the Rate of Locally Testable Affine-Invariant Codes | 2011-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002812 | 2011-05-24 | Paper |
| Locally Testable Codes Require Redundant Testers | 2011-04-04 | Paper |
| Random CNF's are hard for the polynomial calculus | 2011-02-18 | Paper |
| Limitation on the Rate of Families of Locally Testable Codes | 2010-10-12 | Paper |
| Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas | 2010-09-29 | Paper |
| Low Rate Is Insufficient for Local Testability | 2010-09-10 | Paper |
| Some 3CNF properties are hard to test | 2010-08-16 | Paper |
| Randomness-efficient low degree tests and short PCPs via epsilon-biased sets | 2010-08-16 | Paper |
| Simple PCPs with poly-log rate and query complexity | 2010-08-16 | Paper |
| Robust pcps of proximity, shorter pcps and applications to coding | 2010-08-15 | Paper |
| Size space tradeoffs for resolution | 2010-08-05 | Paper |
| Hard examples for bounded depth frege | 2010-08-05 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Size-Space Tradeoffs for Resolution | 2010-01-06 | Paper |
| Composition of Semi-LTCs by Two-Wise Tensor Products | 2009-10-28 | Paper |
| Short PCPs with Polylog Query Complexity | 2009-04-30 | Paper |
| Tensor Products of Weakly Smooth Codes Are Robust | 2008-11-27 | Paper |
| Sound 3-Query PCPPs Are Long | 2008-08-28 | Paper |
| Linear Upper Bounds for Random Walk on Small Density Random 3‐CNFs | 2007-10-22 | Paper |
| Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding | 2007-09-07 | Paper |
| Robust locally testable codes and products of codes | 2006-09-06 | Paper |
| Some 3CNF Properties Are Hard to Test | 2005-10-28 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Near optimal seperation of tree-like and general resolution | 2005-07-05 | Paper |
| Pseudorandom Generators in Propositional Proof Complexity | 2005-02-21 | Paper |
| Hard examples for the bounded depth Frege proof system | 2004-05-27 | Paper |
| Space complexity of random formulae in resolution | 2003-08-06 | Paper |
| Short proofs are narrow—resolution made simple | 2003-06-25 | Paper |
| Space Complexity in Propositional Calculus | 2002-09-29 | Paper |
