| 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 |
scientific article; zbMATH DE number 7758331 (Why is no real title available?)
| 2023-10-31 | Paper |
Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
Theory of Cryptography | 2023-08-14 | Paper |
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
SIAM Journal on Computing | 2023-07-06 | Paper |
Extracting Mergers and Projections of Partitions
| 2023-06-29 | Paper |
scientific article; zbMATH DE number 7650353 (Why is no real title available?)
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650135 (Why is no real title available?)
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7561763 (Why is no real title available?)
| 2022-07-21 | Paper |
Interpolation decoding
| 2021-11-26 | Paper |
On List Recovery of High-Rate Tensor Codes
IEEE Transactions on Information Theory | 2021-02-22 | Paper |
scientific article; zbMATH DE number 7250164 (Why is no real title available?)
| 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
Combinatorica | 2019-02-01 | Paper |
Certifying polynomials for \(\mathsf{AC}^0[\oplus\) circuits, with applications to lower bounds and circuit compression]
Theory of Computing | 2019-01-31 | Paper |
Constant rate PCPs for circuit-SAT with sublinear query complexity
Journal of the ACM | 2018-08-02 | Paper |
On strictly nonzero integer-valued charges
Proceedings of the American Mathematical Society | 2018-07-17 | Paper |
Maximally Recoverable Codes for Grid-like Topologies
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Robust positioning patterns
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
High-rate locally correctable and locally testable codes with sub-polynomial query complexity
Journal of the ACM | 2018-05-17 | Paper |
Near-optimal approximation algorithm for simultaneous Max-Cut
| 2018-03-15 | Paper |
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields
| 2018-03-15 | Paper |
Decoding Reed-Muller codes over product sets
Theory of Computing | 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
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Explicit subspace designs
Combinatorica | 2017-08-25 | Paper |
Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
On the List-Decodability of Random Linear Codes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
New affine-invariant codes from lifting
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
List-Decoding Algorithms for Lifted Codes
IEEE Transactions on Information Theory | 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
Theory of Computing | 2016-08-22 | Paper |
A local central limit theorem for triangles in a random graph
Random Structures & Algorithms | 2016-07-25 | Paper |
Some remarks on multiplicity codes
| 2016-01-27 | Paper |
Simultaneous approximation of constraint satisfaction problems
Automata, Languages, and Programming | 2015-10-27 | Paper |
List-decoding multiplicity codes
Theory of Computing | 2015-08-21 | Paper |
High-rate codes with sublinear-time decoding
Journal of the ACM | 2015-08-14 | Paper |
Equivalence of polynomial identity testing and polynomial factorization
Computational Complexity | 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
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Random graphs and the parity quantifier
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Roots and coefficients of polynomials over finite fields
Finite Fields and their Applications | 2014-09-02 | Paper |
Local list-decoding and testing of random linear codes from high error
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
On the list-decodability of random linear codes
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
A new family of locally correctable codes based on degree-lifted algebraic geometry codes
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Efficient indexing of necklaces and irreducible polynomials over finite fields
Automata, Languages, and Programming | 2014-07-01 | Paper |
High-rate codes with sublinear-time decoding
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
On the complexity of powering in finite fields
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Extensions to the method of multiplicities, with applications to Kakeya sets and mergers
SIAM Journal on Computing | 2014-04-11 | Paper |
Random graphs and the parity quantifier
Journal of the ACM | 2014-02-17 | Paper |
Local list-decoding and testing of random linear codes from high error
SIAM Journal on Computing | 2013-09-25 | Paper |
Affine dispersers from subspace polynomials
SIAM Journal on Computing | 2012-11-29 | Paper |
The homomorphism domination exponent
European Journal of Combinatorics | 2011-11-29 | Paper |
Kakeya-type sets in finite vector spaces
Journal of Algebraic Combinatorics | 2011-11-07 | Paper |
Optimal testing of Reed-Muller codes
Property Testing | 2010-10-12 | Paper |
Some recent results on local testing of sparse linear codes
Property Testing | 2010-10-12 | Paper |
A framework for pursuit evasion games in
Information Processing Letters | 2009-12-18 | Paper |
Tolerant Linearity Testing and Locally Testable Codes
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
scientific article; zbMATH DE number 5485539 (Why is no real title available?)
| 2009-01-05 | Paper |
The minimum rank problem: A counterexample
Linear Algebra and its Applications | 2008-03-14 | Paper |
Local Decoding and Testing for Homomorphisms
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 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 |
