| Combinatorics via Closed Orbits: Number Theoretic Ramanujan Graphs Are Not Unique Neighbor Expanders | 0 | 0.34 | 2022 |
| Hypercontractivity on High Dimensional Expanders | 0 | 0.34 | 2022 |
| High Dimensional Expansion Implies Amplified Local Testability. | 0 | 0.34 | 2022 |
| Improved Optimal Testing Results from Global Hypercontractivity | 0 | 0.34 | 2022 |
| List-Decoding With Double Samplers | 0 | 0.34 | 2021 |
| Coboundary and Cosystolic Expansion from Strong Symmetry. | 0 | 0.34 | 2021 |
| New cosystolic expanders from tensors imply explicit Quantum LDPC codes with Ω(√n logk n) distance | 1 | 0.35 | 2021 |
| Local-To-Global Agreement Expansion via the Variance Method. | 0 | 0.34 | 2020 |
| Chernoff Bound for High-Dimensional Expanders. | 0 | 0.34 | 2020 |
| Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expanders | 1 | 0.35 | 2020 |
| From Local to Robust Testing via Agreement Testing. | 0 | 0.34 | 2019 |
| Testing Odd Direct Sums Using High Dimensional Expanders. | 0 | 0.34 | 2019 |
| Construction of new local spectral high dimensional expanders. | 1 | 0.37 | 2018 |
| Cosystolic Expanders over any Abelian Group. | 0 | 0.34 | 2018 |
| High Order Random Walks: Beyond Spectral Gap | 4 | 0.46 | 2018 |
| List Decoding with Double Samplers. | 0 | 0.34 | 2018 |
| Good Distance Lattices from High Dimensional Expanders. | 1 | 0.35 | 2018 |
| High Dimensional Expanders Imply Agreement Expanders | 7 | 0.62 | 2017 |
| High Dimensional Random Walks and Colorful Expansion. | 0 | 0.34 | 2017 |
| Walking on the Edge and Cosystolic Expansion. | 1 | 0.44 | 2016 |
| Bounded degree cosystolic expanders of every dimension. | 10 | 0.86 | 2016 |
| High Dimensional Combinatorial Random Walks and Colorful Expansion. | 3 | 0.49 | 2016 |
| On Expansion and Topological Overlap | 0 | 0.34 | 2015 |
| Systolic Expanders of Every Dimension. | 1 | 0.39 | 2015 |
| Isoperimetric Inequalities for Ramanujan Complexes and Topological Expanders | 10 | 1.08 | 2014 |
| Ramanujan Complexes and Bounded Degree Topological Expanders | 10 | 0.80 | 2014 |
| High dimensional expanders and property testing | 7 | 0.98 | 2014 |
| 2-Transitivity is Insufficient for Local Testability | 14 | 0.64 | 2013 |
| Comparing the strength of query types in property testing: The case of k-colorability | 0 | 0.34 | 2013 |
| Explicit Low-Weight Bases for BCH Codes | 1 | 0.40 | 2012 |
| Weight Distribution and List-Decoding Size of Reed–Muller Codes | 9 | 0.55 | 2012 |
| Edge transitive ramanujan graphs and symmetric LDPC good codes | 5 | 0.54 | 2012 |
| Succinct Representation of Codes with Applications to Testing. | 0 | 0.34 | 2012 |
| New Extension of the Weil Bound for Character Sums with Applications to Coding | 9 | 0.66 | 2011 |
| Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes | 0 | 0.34 | 2011 |
| Dense locally testable codes cannot have constant rate and distance | 4 | 0.40 | 2010 |
| Testing of exponentially large codes, by a new extension to Weil bound for character sums | 5 | 0.43 | 2010 |
| Breaking the Epsilon-Soundness Bound of the Linearity Test over GF(2) | 9 | 0.64 | 2010 |
| Proximity Oblivious Testing and the Role of Invariances | 11 | 0.58 | 2010 |
| Locally testable vs. locally decodable codes | 1 | 0.35 | 2010 |
| Locally Testable Codes Require Redundant Testers | 13 | 0.58 | 2009 |
| Succinct Representation of Codes with Applications to Testing | 14 | 0.63 | 2009 |
| Testing Triangle-Freeness in General Graphs | 32 | 1.54 | 2008 |
| Worst Case to Average Case Reductions for Polynomials | 22 | 1.18 | 2008 |
| A (de)constructive approach to program checking | 12 | 0.60 | 2008 |
| Comparing the strength of query types in property testing: the case of testing k-colorability | 8 | 0.56 | 2008 |
| The List-Decoding Size of Reed-Muller Codes | 4 | 0.56 | 2008 |
| Testing k-wise and almost k-wise independence | 52 | 2.19 | 2007 |
| Guessing secrets efficiently via list decoding | 18 | 1.18 | 2007 |
| Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2). | 4 | 0.55 | 2007 |
