| Publication | Date of Publication | Type |
|---|
Linear independence, alternants and applications
SIAM Journal on Computing | 2026-02-04 | Paper |
| Lower bounds for set-multilinear branching programs | 2026-01-28 | Paper |
| Near-optimal set-multilinear formula lower bounds | 2024-11-19 | Paper |
| Improved low-depth set-multilinear circuit lower bounds | 2024-07-05 | Paper |
| Linear independence, alternants, and applications | 2024-05-08 | Paper |
Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
SIAM Journal on Computing | 2023-07-06 | Paper |
scientific article; zbMATH DE number 7650353 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7650135 (Why is no real title available?) | 2023-02-03 | Paper |
On List Recovery of High-Rate Tensor Codes
IEEE Transactions on Information Theory | 2021-02-22 | Paper |
Reconstruction of Depth-4 Multilinear Circuits
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Deterministic factorization of sparse polynomials with bounded individual degree
Journal of the ACM | 2020-11-11 | Paper |
| scientific article; zbMATH DE number 7250164 (Why is no real title available?) | 2020-09-22 | Paper |
On the number of ordinary lines determined by sets in complex space
Discrete & Computational Geometry | 2019-05-21 | Paper |
Helly-type theorems in property testing
International Journal of Computational Geometry & Applications | 2019-04-24 | Paper |
DEEP-FRI: Sampling outside the box improves soundness
(available as arXiv preprint) | 2019-03-28 | Paper |
Black-box identity testing of depth-4 multilinear circuits
Combinatorica | 2019-02-01 | Paper |
Finite field Kakeya and Nikodym sets in three dimensions
SIAM Journal on Discrete Mathematics | 2018-12-12 | Paper |
On the number of ordinary lines determined by sets in complex space
(available as arXiv preprint) | 2018-08-13 | Paper |
Maximally Recoverable Codes for Grid-like Topologies
Proceedings of the Twenty-Eighth 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 |
Superquadratic lower bound for 3-query locally correctable codes over the reals
Theory of Computing | 2017-11-14 | Paper |
Arithmetic circuits with locally low algebraic rank
Theory of Computing | 2017-10-11 | Paper |
Sums of products of polynomials in few variables: lower bounds and polynomial identity testing
(available as arXiv preprint) | 2017-10-10 | Paper |
| Arithmetic circuits with locally low algebraic rank | 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 |
Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin.
Combinatorica | 2017-03-31 | Paper |
On the power of homogeneous depth 4 arithmetic circuits
SIAM Journal on Computing | 2017-03-10 | Paper |
| Towards an algebraic natural proofs barrier via polynomial identity testing | 2017-01-06 | Paper |
Incidence bounds for block designs
SIAM Journal on Discrete Mathematics | 2016-10-28 | Paper |
The limits of depth reduction for arithmetic formulas: it's all about the top fan-in
SIAM Journal on Computing | 2015-11-18 | Paper |
High-rate codes with sublinear-time decoding
Journal of the ACM | 2015-08-14 | Paper |
The limits of depth reduction for arithmetic formulas
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Breaking the quadratic barrier for 3-LCC's over the reals
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Equivalence of polynomial identity testing and polynomial factorization
Computational Complexity | 2015-06-23 | Paper |
Improved rank bounds for design matrices and a new proof of Kelly's theorem
Forum of Mathematics, Sigma | 2014-09-01 | Paper |
Sylvester-Gallai type theorems for approximate collinearity
Forum of Mathematics, Sigma | 2014-09-01 | 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 |
Tight Lower Bounds for 2-query LCCs over Finite Fields
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Blackbox Polynomial Identity Testing for Depth 3 Circuits
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | 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 |
Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits
Automata, Languages, and Programming | 2014-07-01 | Paper |
Lower bounds for approximate LDCs
Automata, Languages, and Programming | 2014-07-01 | Paper |
Lower bounds for approximate LDCs
Automata, Languages, and Programming | 2014-07-01 | Paper |
Black-box identity testing of depth-4 multilinear circuits
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
High-rate codes with sublinear-time decoding
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 |
Helly-type theorems in property testing
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Local list-decoding and testing of random linear codes from high error
SIAM Journal on Computing | 2013-09-25 | Paper |
Kakeya-type sets in finite vector spaces
Journal of Algebraic Combinatorics | 2011-11-07 | Paper |
Some recent results on local testing of sparse linear codes
Property Testing | 2010-10-12 | Paper |
Tolerant Linearity Testing and Locally Testable Codes
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
An improved lower bound on the size of Kakeya sets over finite fields
Analysis & PDE | 2009-09-17 | Paper |
Acute and nonobtuse triangulations of polyhedral surfaces
European Journal of Combinatorics | 2009-06-17 | Paper |
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes
(available as arXiv preprint) | N/A | Paper |
