| Publication | Date of Publication | Type |
|---|
| Extracting mergers and projections of partitions | 2025-01-14 | Paper |
| Elliptic curve fast Fourier transform (ECFFT). I: Low-degree extension in time \(O(n \log n)\) over all finite fields | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6062153 | 2023-10-31 | Paper |
| Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II | 2023-08-14 | Paper |
| Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes | 2023-07-06 | Paper |
| Extracting Mergers and Projections of Partitions | 2023-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875697 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875528 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092486 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5013046 | 2021-11-26 | Paper |
| On List Recovery of High-Rate Tensor Codes | 2021-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121912 | 2020-09-22 | Paper |
| Geometric rank of tensors and subrank of matrix multiplication | 2020-02-21 | Paper |
| DEEP-FRI: Sampling outside the box improves soundness | 2019-03-28 | Paper |
| A Cauchy-Davenport theorem for linear maps | 2019-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4612476 | 2019-01-31 | Paper |
| Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity | 2018-08-02 | Paper |
| On strictly nonzero integer-valued charges | 2018-07-17 | Paper |
| Maximally Recoverable Codes for Grid-like Topologies | 2018-07-16 | Paper |
| Robust positioning patterns | 2018-07-16 | Paper |
| High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity | 2018-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607982 | 2018-03-15 | Paper |
| Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4602396 | 2018-01-10 | Paper |
| Decoding Reed-Muller codes over product sets | 2017-10-10 | Paper |
| High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity | 2017-09-29 | Paper |
| Explicit subspace designs | 2017-08-25 | Paper |
| Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes | 2017-07-27 | Paper |
| On the List-Decodability of Random Linear Codes | 2017-07-27 | Paper |
| New affine-invariant codes from lifting | 2017-05-16 | Paper |
| List-Decoding Algorithms for Lifted Codes | 2017-04-28 | Paper |
| Certifying polynomials for AC^0(parity) circuits, with applications | 2017-01-26 | Paper |
| Efficient indexing of necklaces and irreducible polynomials over finite fields | 2016-08-22 | Paper |
| A local central limit theorem for triangles in a random graph | 2016-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3464538 | 2016-01-27 | Paper |
| Simultaneous Approximation of Constraint Satisfaction Problems | 2015-10-27 | Paper |
| Some remarks on multiplicity codes | 2015-08-21 | Paper |
| High-rate codes with sublinear-time decoding | 2015-08-14 | Paper |
| Equivalence of polynomial identity testing and polynomial factorization | 2015-06-23 | Paper |
| The complexity of computing the minimum rank of a sign pattern matrix | 2015-03-15 | Paper |
| Affine dispersers from subspace polynomials | 2015-02-04 | Paper |
| Random graphs and the parity quantifier | 2015-02-04 | Paper |
| Roots and coefficients of polynomials over finite fields | 2014-09-02 | Paper |
| Local list-decoding and testing of random linear codes from high error | 2014-08-13 | Paper |
| On the list-decodability of random linear codes | 2014-08-13 | Paper |
| A new family of locally correctable codes based on degree-lifted algebraic geometry codes | 2014-08-07 | Paper |
| Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers | 2014-07-25 | Paper |
| Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields | 2014-07-01 | Paper |
| High-rate codes with sublinear-time decoding | 2014-06-05 | Paper |
| On the complexity of powering in finite fields | 2014-06-05 | Paper |
| Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers | 2014-04-11 | Paper |
| Random graphs and the parity quantifier | 2014-02-17 | Paper |
| Local list-decoding and testing of random linear codes from high error | 2013-09-25 | Paper |
| Affine Dispersers from Subspace Polynomials | 2012-11-29 | Paper |
| The homomorphism domination exponent | 2011-11-29 | Paper |
| Kakeya-type sets in finite vector spaces | 2011-11-07 | Paper |
| Optimal Testing of Reed-Muller Codes | 2010-10-12 | Paper |
| Some Recent Results on Local Testing of Sparse Linear Codes | 2010-10-12 | Paper |
| A framework for pursuit evasion games in | 2009-12-18 | Paper |
| Tolerant Linearity Testing and Locally Testable Codes | 2009-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549711 | 2009-01-05 | Paper |
| The minimum rank problem: A counterexample | 2008-03-14 | Paper |
| Local Decoding and Testing for Homomorphisms | 2007-08-28 | Paper |
| Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes | N/A | Paper |
| On the degree of polynomials computing square roots mod p | N/A | Paper |
