| A Sauer-Shelah-Perles Lemma for Lattices | 0 | 0.34 | 2020 |
| Spanoids - an abstraction of spanning structures, and a barrier for LCCs | 1 | 0.35 | 2020 |
| Fourier and Circulant Matrices are Not Rigid. | 0 | 0.34 | 2019 |
| A Sauer-Shelah-Perles Lemma for Sumsets. | 0 | 0.34 | 2018 |
| Static Data Structure Lower Bounds Imply Rigidity. | 1 | 0.35 | 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 |
| Outlaw distributions and locally decodable codes. | 0 | 0.34 | 2017 |
| Matrix Rigidity and the Croot-Lev-Pach Lemma | 1 | 0.40 | 2017 |
| Special issue "Computational Complexity Conference 2015" Guest Editors' Foreword. | 0 | 0.34 | 2016 |
| Tight lower bounds for linear 2-query LCCs over finite fields. | 1 | 0.35 | 2016 |
| On the Number of Rich Lines in Truly High Dimensional Sets. | 2 | 0.45 | 2015 |
| A Quantitative Variant of the Multi-colored Motzkin–Rabin Theorem | 0 | 0.34 | 2015 |
| 2-Server PIR with sub-polynomial communication. | 14 | 0.99 | 2014 |
| Testing Equivalence of Polynomials under Shifts. | 5 | 0.44 | 2014 |
| Sylvester–Gallai for Arrangements of Subspaces | 1 | 0.35 | 2014 |
| Lower Bounds for Approximate LDCs. | 0 | 0.34 | 2014 |
| Factors of Sparse Polynomials are Sparse. | 2 | 0.36 | 2014 |
| Affine extractors over large fields with exponential error. | 1 | 0.35 | 2014 |
| Breaking the quadratic barrier for 3-LCC's over the reals | 9 | 0.81 | 2014 |
| Matching-Vector Families and LDCs Over Large Modulo | 3 | 0.46 | 2013 |
| New bounds for matching vector families | 6 | 0.53 | 2013 |
| Pseudorandomness for Width-2 Branching Programs. | 14 | 0.57 | 2013 |
| Variety Evasive Sets | 0 | 0.34 | 2012 |
| 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 |
| Incidence Theorems And Their Applications | 10 | 0.81 | 2012 |
| Extractors for varieties. | 7 | 0.45 | 2012 |
| New Lower Bounds for Matching Vector Codes | 3 | 0.40 | 2012 |
| Subspace evasive sets | 17 | 0.81 | 2011 |
| Matching Vector Codes | 20 | 0.87 | 2011 |
| Restriction access | 7 | 0.58 | 2011 |
| Tight Lower Bounds for 2-query LCCs over Finite Fields | 6 | 0.55 | 2011 |
| Separating multilinear branching programs and formulas | 9 | 0.56 | 2011 |
| Kakeya Sets, New Mergers, and Old Extractors | 17 | 0.77 | 2011 |
| Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes | 16 | 0.87 | 2010 |
| Matching Vector Codes. | 2 | 0.39 | 2010 |
| Monotone Expanders: Constructions and Applications | 4 | 0.48 | 2010 |
| On Approximating the Entropy of Polynomial Mappings. | 11 | 0.51 | 2010 |
| Pseudorandomness for Width 2 Branching Programs. | 0 | 0.34 | 2009 |
| From Randomness Extraction to Rotating Needles | 3 | 0.51 | 2009 |
| Extractors for Varieties | 17 | 0.82 | 2009 |
| On Matrix Rigidity and Locally Self-Correctable Codes | 12 | 0.72 | 2009 |
| Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers | 36 | 1.64 | 2009 |
| Deterministic Extractors for Algebraic Sources | 1 | 0.39 | 2008 |
| Towards Dimension Expanders over Finite Fields | 4 | 0.45 | 2008 |
| Noisy Interpolating Sets for Low Degree Polynomials | 3 | 0.50 | 2008 |
| An Improved Analysis of Linear Mergers | 7 | 0.60 | 2007 |
| Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits | 61 | 1.68 | 2007 |
| Extractors and Rank Extractors for Polynomial Sources | 20 | 0.80 | 2007 |
