| Geometric rank of tensors and subrank of matrix multiplication | 0 | 0.34 | 2020 |
| Proximity Gaps for Reed–Solomon Codes | 0 | 0.34 | 2020 |
| Quasilinear time list-decodable codes for space bounded channels. | 0 | 0.34 | 2019 |
| DEEP-FRI: Sampling Outside the Box Improves Soundness. | 0 | 0.34 | 2019 |
| On List Recovery of High-Rate Tensor Codes | 1 | 0.35 | 2019 |
| Quasilinear Time List-Decodable Codes for Space Bounded Channels | 0 | 0.34 | 2019 |
| Near-optimal approximation algorithm for simultaneous Max-Cut. | 0 | 0.34 | 2018 |
| Improved Decoding of Folded Reed-Solomon and Multiplicity Codes | 0 | 0.34 | 2018 |
| A Cauchy-Davenport theorem for linear maps | 0 | 0.34 | 2018 |
| On Multilinear Forms: Bias, Correlation, and Tensor Rank. | 0 | 0.34 | 2018 |
| Certifying Polynomials for $\mathrm{AC}^0[\oplus]$ Circuits, with Applications to Lower Bounds and Circuit Compression. | 0 | 0.34 | 2018 |
| Worst-case to average case reductions for the distance to a code. | 0 | 0.34 | 2018 |
| High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity. | 2 | 0.37 | 2017 |
| Local Testing and Decoding of High-Rate Error-Correcting Codes. | 0 | 0.34 | 2017 |
| Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound. | 1 | 0.35 | 2017 |
| Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields. | 0 | 0.34 | 2017 |
| Robust positioning patterns. | 1 | 0.35 | 2016 |
| Guest Column: Local Testing and Decoding of High-Rate Error-Correcting Codes. | 1 | 0.36 | 2016 |
| A local central limit theorem for triangles in a random graph. | 1 | 0.35 | 2016 |
| High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity. | 1 | 0.35 | 2015 |
| High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. | 0 | 0.34 | 2015 |
| The complexity of computing the minimum rank of a sign pattern matrix. | 5 | 0.50 | 2015 |
| Decoding Reed-Muller codes over product sets | 2 | 0.44 | 2015 |
| Equivalence of Polynomial Identity Testing and Polynomial Factorization | 5 | 0.45 | 2015 |
| Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields. | 0 | 0.34 | 2015 |
| Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization | 9 | 0.57 | 2014 |
| Simultaneous Approximation of Constraint Satisfaction Problems. | 1 | 0.36 | 2014 |
| List-decoding algorithms for lifted codes. | 4 | 0.47 | 2014 |
| Roots and coefficients of polynomials over finite fields. | 1 | 0.64 | 2014 |
| Local List-Decoding and Testing of Random Linear Codes from High Error. | 1 | 0.35 | 2013 |
| Random graphs and the parity quantifier | 3 | 0.53 | 2013 |
| Explicit Subspace Designs | 12 | 0.63 | 2013 |
| New affine-invariant codes from lifting | 26 | 1.04 | 2012 |
| Certifying Polynomials for $\mathrm{AC}^0[\oplus]$ circuits, with applications. | 0 | 0.34 | 2012 |
| List-Decoding Multiplicity Codes. | 12 | 0.71 | 2012 |
| A new family of locally correctable codes based on degree-lifted algebraic geometry codes | 3 | 0.48 | 2012 |
| Certifying polynomials for AC^0(parity) circuits, with applications. | 5 | 0.44 | 2012 |
| On the complexity of powering in finite fields | 4 | 0.42 | 2011 |
| The homomorphism domination exponent | 2 | 0.40 | 2011 |
| Review of algebraic function fields and codes by Henning Stichtenoth | 0 | 0.34 | 2011 |
| Subspace polynomials and limits to list decoding of Reed-Solomon codes | 11 | 1.19 | 2010 |
| Local list-decoding and testing of random linear codes from high error | 7 | 0.47 | 2010 |
| Some recent results on local testing of sparse linear codes | 0 | 0.34 | 2010 |
| High-rate codes with sublinear-time decoding | 22 | 1.30 | 2010 |
| On the list-decodability of random linear codes | 18 | 1.00 | 2010 |
| Local list-decoding and testing of random linear codes from high-error | 0 | 0.34 | 2009 |
| On the Communication Complexity of Read-Once AC^0 Formulae | 7 | 0.51 | 2009 |
| Affine dispersers from subspace polynomials | 12 | 1.00 | 2009 |
| Optimal Testing of Reed-Muller Codes | 28 | 1.14 | 2009 |
| Tolerant Linearity Testing and Locally Testable Codes | 14 | 0.64 | 2009 |
