| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126349 | 2024-04-09 | Paper |
| Bias vs Structure of Polynomials in Large Fields, and Applications in Information Theory | 2024-03-18 | Paper |
| Hypercontractivity on high dimensional expanders | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6090909 | 2023-11-20 | Paper |
| Log-rank and lifting for AND-functions | 2023-11-14 | Paper |
| Fractional pseudorandom generators from any fourier level | 2023-07-12 | Paper |
| Decision List Compression by Mild Random Restrictions | 2022-12-08 | Paper |
| Approximate union closed conjecture | 2022-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091755 | 2022-07-27 | Paper |
| Optimality of linear sketching under modular updates | 2022-07-27 | Paper |
| Equality alone does not simulate randomness | 2022-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5093405 | 2022-07-26 | Paper |
| Sign rank vs discrepancy | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090385 | 2022-07-18 | Paper |
| Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates | 2022-07-18 | Paper |
| Eigenstripping, Spectral Decay, and Edge-Expansion on Posets | 2022-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028366 | 2022-02-09 | Paper |
| Improved bounds for the sunflower lemma | 2021-12-09 | Paper |
| Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture | 2021-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009548 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002761 | 2021-07-28 | Paper |
| XOR lemmas for resilient functions against polynomials | 2021-01-19 | Paper |
| Decision list compression by mild random restrictions | 2021-01-19 | Paper |
| Improved bounds for the sunflower lemma | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5133219 | 2020-11-12 | Paper |
| High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games | 2020-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121889 | 2020-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121900 | 2020-09-22 | Paper |
| Probabilistic existence of large sets of designs | 2020-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5215661 | 2020-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5215668 | 2020-02-12 | Paper |
| DNF sparsification beyond sunflowers | 2020-01-30 | Paper |
| The analytic rank of tensors and its applications | 2020-01-17 | Paper |
| A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds | 2020-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5204828 | 2019-12-05 | Paper |
| Near-optimal Linear Decision Trees for k-SUM and Related Problems | 2019-11-21 | Paper |
| The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes | 2019-09-02 | Paper |
| Near-optimal linear decision trees for k-SUM and related problems | 2019-08-22 | Paper |
| The Gram-Schmidt walk: a cure for the Banaszczyk blues | 2019-08-22 | Paper |
| On the Beck‐Fiala conjecture for random set systems | 2019-08-14 | Paper |
| Recent advances on the log-rank conjecture in communication complexity | 2019-07-03 | Paper |
| Testing Low Complexity Affine-Invariant Properties | 2019-05-15 | Paper |
| From DNF compression to sunflower theorems via regularity | 2019-03-01 | Paper |
| A counterexample to a strong variant of the Polynomial Freiman-Ruzsa conjecture in Euclidean space | 2019-01-09 | Paper |
| The List Decoding Radius for Reed–Muller Codes Over Small Fields | 2018-09-14 | Paper |
| Communication is Bounded by Root of Rank | 2018-08-02 | Paper |
| Non-Malleable Codes from Additive Combinatorics | 2018-04-26 | Paper |
| Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem | 2018-04-19 | Paper |
| On the Beck-Fiala Conjecture for Random Set Systems | 2018-04-19 | Paper |
| Probabilistic existence of large sets of designs | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608008 | 2018-03-15 | Paper |
| MDS matrices over small fields: A proof of the GM-MDS conjecture | 2018-03-06 | Paper |
| Structure of Protocols for XOR Functions | 2018-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601823 | 2018-01-24 | Paper |
| On the impossibility of entropy reversal, and its application to zero-knowledge proofs | 2018-01-19 | Paper |
| Algebraic Attacks against Random Local Functions and Their Countermeasures | 2018-01-12 | Paper |
| Algebraic attacks against random local functions and their countermeasures | 2017-09-29 | Paper |
| An improved lower bound for arithmetic regularity | 2017-09-28 | Paper |
| Large Supports are required for Well-Supported Nash Equilibria | 2017-08-31 | Paper |
| Probabilistic existence of regular combinatorial structures | 2017-08-30 | Paper |
| Holes in Generalized Reed–Muller Codes | 2017-07-27 | Paper |
| Weight Distribution and List-Decoding Size of Reed–Muller Codes | 2017-07-12 | Paper |
| On the structure of the spectrum of small sets | 2017-02-09 | Paper |
| General systems of linear forms: equidistribution and true complexity | 2016-03-02 | Paper |
| The Fourier structure of low degree polynomials | 2016-02-26 | Paper |
| Group representations that resist random sampling | 2015-11-13 | Paper |
| Constructive Discrepancy Minimization by Walking on the Edges | 2015-11-04 | Paper |
| A tail bound for read-kfamilies of functions | 2015-10-12 | Paper |
| Improved Noisy Population Recovery, and Reverse Bonami-Beckner Inequality for Sparse Functions | 2015-08-21 | Paper |
| The List Decoding Radius of Reed-Muller Codes over Small Fields | 2015-08-21 | Paper |
| An Additive Combinatorics Approach Relating Rank to Communication Complexity | 2015-08-14 | Paper |
| Communication is Bounded by Root of Rank | 2015-06-26 | Paper |
| Non-malleable codes from additive combinatorics | 2015-06-26 | Paper |
| New Bounds for Matching Vector Families | 2015-02-09 | Paper |
| On cryptography with auxiliary input | 2015-02-04 | Paper |
| Variety evasive sets | 2014-11-26 | Paper |
| Correlation Testing for Affine Invariant Properties on $\mathbb{F}_p^n$ in the High Error Regime | 2014-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191585 | 2014-10-06 | Paper |
| Nontrivial \(t\)-designs over finite fields exist for all \(t\) | 2014-09-08 | Paper |
| Every locally characterized affine-invariant property is testable | 2014-08-07 | Paper |
| New bounds for matching vector families | 2014-08-07 | Paper |
| New Extension of the Weil Bound for Character Sums with Applications to Coding | 2014-07-30 | Paper |
| En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations | 2014-07-01 | Paper |
| Correlation testing for affine invariant properties on F p n in the high error regime | 2014-06-05 | Paper |
| The Freiman-Ruzsa theorem over finite fields | 2014-05-26 | Paper |
| Subspace evasive sets | 2014-05-13 | Paper |
| Probabilistic existence of rigid combinatorial structures | 2014-05-13 | Paper |
| A Space Lower Bound for Dynamic Approximate Membership Data Structures | 2014-04-11 | Paper |
| Pseudorandom generators for \(\mathrm{CC}^0[p\) and the Fourier spectrum of low-degree polynomials over finite fields] | 2014-01-29 | Paper |
| Equivalence of polynomial conjectures in additive combinatorics | 2013-11-07 | Paper |
| LOWER BOUNDS FOR ADAPTIVE LINEARITY TESTS | 2013-03-19 | Paper |
| Bounded-depth circuits cannot sample good codes | 2012-12-07 | Paper |
| Almost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions | 2012-11-02 | Paper |
| Inverse Conjecture for the Gowers norm is false | 2012-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2913800 | 2012-09-27 | Paper |
| Random low-degree polynomials are hard to approximate | 2012-06-26 | Paper |
| Higher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear forms | 2012-01-10 | Paper |
| Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates | 2011-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002801 | 2011-05-24 | Paper |
| The complexity of Boolean functions in different characteristics | 2011-02-18 | Paper |
| Random Low Degree Polynomials are Hard to Approximate | 2009-10-28 | Paper |
| Pseudorandom Bit Generators That Fool Modular Sums | 2009-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302078 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302079 | 2009-01-05 | Paper |
| ALMOST EUCLIDEAN SECTIONS OF THE N-DIMENSIONAL CROSS-POLYTOPE USING O(N) RANDOM BITS | 2008-09-25 | Paper |
