| Improved Low-Depth Set-Multilinear Circuit Lower Bounds | 0 | 0.34 | 2022 |
| Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits | 0 | 0.34 | 2021 |
| 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference). | 0 | 0.34 | 2020 |
| Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree | 0 | 0.34 | 2020 |
| Proximity Gaps for Reed–Solomon Codes | 0 | 0.34 | 2020 |
| Front Matter, Table of Contents, Preface, Conference Organization. | 0 | 0.34 | 2020 |
| Reconstruction of Depth-4 Multilinear Circuits. | 0 | 0.34 | 2020 |
| DEEP-FRI: Sampling Outside the Box Improves Soundness. | 0 | 0.34 | 2019 |
| On List Recovery of High-Rate Tensor Codes | 1 | 0.35 | 2019 |
| Improved Decoding of Folded Reed-Solomon and Multiplicity Codes | 0 | 0.34 | 2018 |
| Worst-case to average case reductions for the distance to a code. | 0 | 0.34 | 2018 |
| Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree | 0 | 0.34 | 2018 |
| Superquadratic Lower Bound for 3-Query Locally Correctable Codes over the Reals. | 1 | 0.41 | 2017 |
| On the number of ordinary lines determined by sets in complex space. | 0 | 0.34 | 2017 |
| High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity. | 2 | 0.37 | 2017 |
| Towards an algebraic natural proofs barrier via polynomial identity testing. | 2 | 0.36 | 2017 |
| Maximally Recoverable Codes for Grid-like Topologies. | 0 | 0.34 | 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 |
| Guest Column: Local Testing and Decoding of High-Rate Error-Correcting Codes. | 1 | 0.36 | 2016 |
| Incidence Bounds for Block Designs | 1 | 0.41 | 2016 |
| Arithmetic circuits with locally low algebraic rank. | 3 | 0.37 | 2016 |
| Tight lower bounds for linear 2-query LCCs over finite fields. | 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 |
| Sums of products of polynomials in few variables : lower bounds and polynomial identity testing. | 0 | 0.34 | 2015 |
| Equivalence of Polynomial Identity Testing and Polynomial Factorization | 5 | 0.45 | 2015 |
| On the Power of Homogeneous Depth 4 Arithmetic Circuits | 21 | 0.70 | 2014 |
| Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits. | 10 | 0.55 | 2014 |
| Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization | 9 | 0.57 | 2014 |
| Lower Bounds for Approximate LDCs. | 0 | 0.34 | 2014 |
| Recent Progress on Lower Bounds for Arithmetic Circuits | 1 | 0.35 | 2014 |
| Helly-Type Theorems in Property Testing. | 0 | 0.34 | 2014 |
| Breaking the quadratic barrier for 3-LCC's over the reals | 9 | 0.81 | 2014 |
| Local List-Decoding and Testing of Random Linear Codes from High Error. | 1 | 0.35 | 2013 |
| Lower Bounds for Depth 4 Homogenous Circuits with Bounded Top Fanin. | 6 | 0.53 | 2013 |
| The limits of depth reduction for arithmetic formulas: it's all about the top fan-in | 15 | 0.67 | 2013 |
| Sylvester-Gallai type theorems for approximate collinearity | 0 | 0.34 | 2012 |
| Improved rank bounds for design matrices and a new proof of Kelly's theorem | 5 | 0.69 | 2012 |
| A new family of locally correctable codes based on degree-lifted algebraic geometry codes | 3 | 0.48 | 2012 |
| Black-Box Identity Testing of Depth-4 Multilinear Circuits | 18 | 0.65 | 2011 |
| Tight Lower Bounds for 2-query LCCs over Finite Fields | 6 | 0.55 | 2011 |
| Noisy Interpolation of Sparse Polynomials, and Applications | 8 | 0.51 | 2011 |
| 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 |
| Local list-decoding and testing of random linear codes from high-error | 0 | 0.34 | 2009 |
| Blackbox Polynomial Identity Testing for Depth 3 Circuits | 42 | 1.25 | 2009 |
| Acute and nonobtuse triangulations of polyhedral surfaces | 11 | 0.64 | 2009 |
| Tolerant Linearity Testing and Locally Testable Codes | 14 | 0.64 | 2009 |
