| Publication | Date of Publication | Type |
|---|
| Furstenberg sets in finite fields: explaining and improving the Ellenberg-Erman proof | 2024-02-09 | Paper |
| Proof of the Kakeya set conjecture over rings of integers modulo square-free N | 2022-11-16 | Paper |
| Fourier and circulant matrices are not rigid | 2022-07-27 | Paper |
| Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028497 | 2022-02-10 | Paper |
| Fourier and Circulant Matrices are Not Rigid | 2021-04-01 | Paper |
| A Sauer-Shelah-Perles lemma for lattices | 2020-11-05 | Paper |
| Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs | 2020-05-28 | Paper |
| Static data structure lower bounds imply rigidity | 2020-01-30 | Paper |
| Matrix rigidity and the Croot-Lev-Pach lemma | 2019-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5204830 | 2019-12-05 | Paper |
| Simple proofs for Furstenberg sets over finite fields | 2019-09-06 | Paper |
| On the number of ordinary lines determined by sets in complex space | 2019-05-21 | Paper |
| A Sauer-Shelah-Perles lemma for sumsets | 2018-11-22 | Paper |
| On the number of ordinary lines determined by sets in complex space | 2018-08-13 | Paper |
| 2-Server PIR with Sub-Polynomial Communication | 2018-08-02 | Paper |
| Outlaw distributions and locally decodable codes | 2018-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4591373 | 2017-11-14 | Paper |
| Sylvester-Gallai for Arrangements of Subspaces | 2017-10-10 | Paper |
| On the number of rich lines in truly high dimensional sets | 2017-10-10 | Paper |
| Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin. | 2017-03-31 | Paper |
| Sylvester-Gallai for arrangements of subspaces | 2016-12-20 | Paper |
| Affine extractors over large fields with exponential error | 2016-11-30 | Paper |
| Restriction access | 2016-10-07 | Paper |
| 2-Server PIR with Sub-Polynomial Communication | 2015-08-21 | Paper |
| Breaking the quadratic barrier for 3-LCC's over the reals | 2015-06-26 | Paper |
| A quantitative variant of the multi-colored Motzkin-Rabin theorem | 2015-02-19 | Paper |
| New Bounds for Matching Vector Families | 2015-02-09 | Paper |
| Variety evasive sets | 2014-11-26 | Paper |
| SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY | 2014-09-01 | Paper |
| IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM | 2014-09-01 | Paper |
| New bounds for matching vector families | 2014-08-07 | Paper |
| Tight Lower Bounds for 2-query LCCs over Finite Fields | 2014-07-30 | Paper |
| Fractional Sylvester–Gallai theorems | 2014-07-25 | Paper |
| Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers | 2014-07-25 | Paper |
| Lower Bounds for Approximate LDCs | 2014-07-01 | Paper |
| Testing Equivalence of Polynomials under Shifts | 2014-07-01 | Paper |
| Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes | 2014-06-05 | Paper |
| Subspace evasive sets | 2014-05-13 | Paper |
| Separating multilinear branching programs and formulas | 2014-05-13 | Paper |
| Factors of Sparse Polynomials are Sparse | 2014-04-18 | Paper |
| Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers | 2014-04-11 | Paper |
| Incidence Theorems and Their Applications | 2014-01-08 | Paper |
| Matching-Vector Families and LDCs over Large Modulo | 2013-10-04 | Paper |
| Extractors for varieties | 2012-12-27 | Paper |
| Towards dimension expanders over finite fields | 2011-12-20 | Paper |
| On matrix rigidity and locally self-correctable codes | 2011-11-08 | Paper |
| Matching Vector Codes | 2011-11-07 | Paper |
| Kakeya Sets, New Mergers, and Old Extractors | 2011-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002825 | 2011-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002826 | 2011-05-24 | Paper |
| Extractors and rank extractors for polynomial sources | 2011-02-18 | Paper |
| On the size of Kakeya sets in finite fields | 2010-11-19 | Paper |
| Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits | 2010-09-06 | Paper |
| Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302099 | 2009-01-05 | Paper |
| Analyzing linear mergers | 2008-06-05 | Paper |
| An improved analysis of linear mergers | 2008-02-22 | Paper |
| Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits | 2007-10-22 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Linear Hashing with $\ell_\infty$ guarantees and two-sided Kakeya bounds | 0001-01-03 | Paper |
