| Publication | Date of Publication | Type |
|---|
| Nowhere to go but high: a perspective on high-dimensional expanders | 2024-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187824 | 2024-01-15 | Paper |
| Hypercontractivity on high dimensional expanders | 2023-12-08 | Paper |
| Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders | 2023-12-08 | Paper |
| New cosystolic expanders from tensors imply explicit Quantum LDPC codes with Ω(√ n log k n ) distance | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6062147 | 2023-10-31 | Paper |
| Bounded degree cosystolic expanders of every dimension | 2023-10-19 | Paper |
| High dimensional expanders and coset geometries | 2023-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875508 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875781 | 2023-02-03 | Paper |
| Double Balanced Sets in High Dimensional Expanders | 2022-11-17 | Paper |
| Free Flags Over Local Rings and Powering of High-dimensional Expanders | 2022-10-06 | Paper |
| Fine Grained Analysis of High Dimensional Random Walks | 2022-08-05 | Paper |
| The Cheeger Inequality and Coboundary Expansion: Beyond Constant Coefficients | 2022-08-02 | Paper |
| On Good $2$-Query Locally Testable Codes from Sheaves on High Dimensional Expanders | 2022-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5093398 | 2022-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090403 | 2022-07-18 | Paper |
| Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders | 2022-07-08 | Paper |
| Eigenstripping, Spectral Decay, and Edge-Expansion on Posets | 2022-05-02 | Paper |
| Improved Optimal Testing Results from Global Hypercontractivity | 2022-02-17 | Paper |
| Erratum to: ``High order random walks: beyond spectral gap | 2022-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009543 | 2021-08-04 | Paper |
| High dimensional expansion implies amplified local testability | 2021-07-22 | Paper |
| List-Decoding with Double Samplers | 2021-03-24 | Paper |
| Garland's Technique for Posets and High Dimensional Grassmannian Expanders | 2021-01-29 | Paper |
| High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games | 2020-11-09 | Paper |
| High order random walks: beyond spectral gap | 2020-10-02 | Paper |
| Transitive bounded-degree 2-expanders from regular 2-expanders | 2020-04-23 | Paper |
| High dimensional expansion using zig-zag product | 2020-01-23 | Paper |
| List Decoding with Double Samplers | 2019-10-15 | Paper |
| Construction of new local spectral high dimensional expanders | 2019-08-22 | Paper |
| Coboundary and cosystolic expansion from strong symmetry | 2019-07-02 | Paper |
| Guessing secrets efficiently via list decoding | 2018-11-05 | Paper |
| On expansion and topological overlap | 2018-08-23 | Paper |
| High Dimensional Random Walks and Colorful Expansion | 2018-05-03 | Paper |
| Good Distance Lattices from High Dimensional Expanders | 2018-03-07 | Paper |
| On Expansion and Topological Overlap | 2018-01-30 | Paper |
| Bounded degree cosystolic expanders of every dimension | 2017-09-29 | Paper |
| Weight Distribution and List-Decoding Size of Reed–Muller Codes | 2017-07-12 | Paper |
| Explicit Low-Weight Bases for BCH Codes | 2017-07-12 | Paper |
| High Order Random Walks: Beyond Spectral Gap | 2017-07-10 | Paper |
| High dimensional expanders and property testing | 2017-05-19 | Paper |
| Symmetric LDPC codes and local testing | 2017-03-31 | Paper |
| Isoperimetric inequalities for Ramanujan complexes and topological expanders | 2016-06-14 | Paper |
| Walking on the Edge and Cosystolic Expansion | 2016-06-06 | Paper |
| Ramanujan Complexes and bounded degree topological expanders | 2014-08-27 | Paper |
| New Extension of the Weil Bound for Character Sums with Applications to Coding | 2014-07-30 | Paper |
| Edge transitive ramanujan graphs and symmetric LDPC good codes | 2014-05-13 | Paper |
| Comparing the strength of query types in property testing: the case of \(k\)-colorability | 2013-04-11 | Paper |
| 2-transitivity is insufficient for local testability | 2013-04-11 | Paper |
| Succinct Representation of Codes with Applications to Testing | 2013-04-09 | Paper |
| Proximity Oblivious Testing and the Role of Invariances | 2011-08-19 | Paper |
| Dense Locally Testable Codes Cannot Have Constant Rate and Distance | 2011-08-17 | Paper |
| Proximity Oblivious Testing and the Role of Invariances | 2011-08-17 | Paper |
| Locally Testable Codes Require Redundant Testers | 2011-04-04 | Paper |
| Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2) | 2010-11-04 | Paper |
| Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability | 2010-10-12 | Paper |
| Symmetric LDPC Codes and Local Testing | 2010-10-12 | Paper |
| Locally Testable vs. Locally Decodable Codes | 2010-09-10 | Paper |
| Testing triangle-freeness in general graphs | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579435 | 2010-08-06 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Succinct Representation of Codes with Applications to Testing | 2009-10-28 | Paper |
| Testing Triangle-Freeness in General Graphs | 2009-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549643 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549649 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549694 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549724 | 2009-01-05 | Paper |
| Testing Reed–Muller Codes | 2008-12-21 | Paper |
| A Characterization of Low-Weight Words That Span Generalized Reed–Muller Codes | 2008-12-21 | Paper |
| Breaking the ε-Soundness Bound of the Linearity Test over GF(2) | 2008-11-27 | Paper |
| Testing Polynomials over General Fields | 2007-06-26 | Paper |
| Applied Algebra, Algebraic Algorithms and Error-Correcting Codes | 2007-02-12 | Paper |
| Tight Bounds for Testing Bipartiteness in General Graphs | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828940 | 2004-11-29 | Paper |
