| Publication | Date of Publication | Type |
|---|
| Fractional certificates for bounded functions | 2024-09-25 | Paper |
| Eigenstripping, spectral decay, and edge-expansion on posets | 2024-08-22 | Paper |
| High dimensional expanders: eigenstripping, pseudorandomness, and unique games | 2024-07-19 | Paper |
Realizable learning is all you need
TheoretiCS | 2024-07-03 | Paper |
| Sampling equilibria: fast no-regret learning in structured games | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7829336 (Why is no real title available?) | 2024-04-09 | Paper |
Bias vs Structure of Polynomials in Large Fields, and Applications in Information Theory
IEEE Transactions on Information Theory | 2024-03-18 | Paper |
Hypercontractivity on high dimensional expanders
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
scientific article; zbMATH DE number 7768378 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-20 | Paper |
Log-rank and lifting for AND-functions
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Fractional pseudorandom generators from any fourier level
(available as arXiv preprint) | 2023-07-12 | Paper |
Decision List Compression by Mild Random Restrictions
Journal of the ACM | 2022-12-08 | Paper |
| Approximate union closed conjecture | 2022-11-21 | Paper |
| Equality alone does not simulate randomness | 2022-07-27 | Paper |
scientific article; zbMATH DE number 7564405 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-27 | Paper |
Optimality of linear sketching under modular updates
(available as arXiv preprint) | 2022-07-27 | Paper |
Sign-rank vs. discrepancy
Theory of Computing | 2022-07-26 | Paper |
| Sign rank vs discrepancy | 2022-07-21 | Paper |
| Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559056 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| Eigenstripping, Spectral Decay, and Edge-Expansion on Posets | 2022-05-02 | Paper |
Sunflowers and robust sunflowers from randomness extractors
Theory of Computing | 2022-02-09 | Paper |
Improved bounds for the sunflower lemma
Annals of Mathematics. Second Series | 2021-12-09 | Paper |
Sparse MDS matrices over small fields: a proof of the GM-MDS conjecture
SIAM Journal on Computing | 2021-08-06 | Paper |
| Sunflowers and quasi-sunflowers from randomness extractors | 2021-08-04 | Paper |
Generalized comparison trees for point-location problems
(available as arXiv preprint) | 2021-07-28 | Paper |
Improved bounds for the sunflower lemma
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Decision list compression by mild random restrictions
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
XOR lemmas for resilient functions against polynomials
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
| Higher-order Fourier analysis and applications | 2020-11-12 | Paper |
| High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games | 2020-11-09 | Paper |
| scientific article; zbMATH DE number 7250152 (Why is no real title available?) | 2020-09-22 | Paper |
| scientific article; zbMATH DE number 7250141 (Why is no real title available?) | 2020-09-22 | Paper |
Probabilistic existence of large sets of designs
Journal of Combinatorial Theory. Series A | 2020-09-07 | Paper |
Towards a constructive version of Banaszczyk's vector balancing theorem
Theory of Computing | 2020-02-12 | Paper |
The Gram-Schmidt walk: a cure for the Banaszczyk blues
Theory of Computing | 2020-02-12 | Paper |
DNF sparsification beyond sunflowers
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds
Discrete Analysis | 2020-01-17 | Paper |
The analytic rank of tensors and its applications
discrete Analysis | 2020-01-17 | Paper |
Pseudorandom generators from polarizing random walks
Theory of Computing | 2019-12-05 | Paper |
Near-optimal linear decision trees for \(k\)-SUM and related problems
Journal of the ACM | 2019-11-21 | Paper |
The independence number of the Birkhoff polytope graph, and applications to maximally recoverable codes
SIAM Journal on Computing | 2019-09-02 | Paper |
The Gram-Schmidt walk: a cure for the Banaszczyk blues
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
The Gram-Schmidt walk: a cure for the Banaszczyk blues
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Near-optimal linear decision trees for k-SUM and related problems
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
On the Beck-Fiala conjecture for random set systems
Random Structures & Algorithms | 2019-08-14 | Paper |
| Recent advances on the log-rank conjecture in communication complexity | 2019-07-03 | Paper |
Recent advances on the log-rank conjecture in communication complexity
(available as arXiv preprint) | 2019-07-03 | Paper |
Testing low complexity affine-invariant properties
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
From DNF compression to sunflower theorems via regularity
(available as arXiv preprint) | 2019-03-01 | Paper |
A counterexample to a strong variant of the polynomial Freiman-Ruzsa conjecture in Euclidean space
Discrete Analysis | 2019-01-09 | Paper |
The List Decoding Radius for Reed–Muller Codes Over Small Fields
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
Communication is bounded by root of rank
Journal of the ACM | 2018-08-02 | Paper |
Non-Malleable Codes from Additive Combinatorics
SIAM Journal on Computing | 2018-04-26 | Paper |
Towards a constructive version of Banaszczyk's vector balancing theorem
(available as arXiv preprint) | 2018-04-19 | Paper |
On the Beck-Fiala conjecture for random set systems
(available as arXiv preprint) | 2018-04-19 | Paper |
| Probabilistic existence of large sets of designs | 2018-03-15 | Paper |
| scientific article; zbMATH DE number 6850428 (Why is no real title available?) | 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
SIAM Journal on Computing | 2018-02-22 | Paper |
scientific article; zbMATH DE number 6829271 (Why is no real title available?)
(available as arXiv preprint) | 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
SIAM Journal on Computing | 2018-01-12 | Paper |
Algebraic attacks against random local functions and their countermeasures
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
An improved lower bound for arithmetic regularity
Mathematical Proceedings of the Cambridge Philosophical Society | 2017-09-28 | Paper |
Large Supports are required for Well-Supported Nash Equilibria
(available as arXiv preprint) | 2017-08-31 | Paper |
Probabilistic existence of regular combinatorial structures
Geometric and Functional Analysis. GAFA | 2017-08-30 | Paper |
Holes in Generalized Reed–Muller Codes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Weight Distribution and List-Decoding Size of Reed–Muller Codes
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
On the structure of the spectrum of small sets
Journal of Combinatorial Theory. Series A | 2017-02-09 | Paper |
Rectangles are nonnegative juntas
SIAM Journal on Computing | 2016-10-28 | Paper |
General systems of linear forms: equidistribution and true complexity
Advances in Mathematics | 2016-03-02 | Paper |
| The Fourier structure of low degree polynomials | 2016-02-26 | Paper |
Group representations that resist random sampling
Random Structures & Algorithms | 2015-11-13 | Paper |
Constructive discrepancy minimization by walking on the edges
SIAM Journal on Computing | 2015-11-04 | Paper |
A tail bound for read-\(k\) families of functions
Random Structures & Algorithms | 2015-10-12 | Paper |
Improved noisy population recovery, and reverse Bonami-Beckner inequality for sparse functions
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
The List Decoding Radius of Reed-Muller Codes over Small Fields
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
An additive combinatorics approach relating rank to communication complexity
Journal of the ACM | 2015-08-14 | Paper |
An additive combinatorics approach relating rank to communication complexity
Journal of the ACM | 2015-08-14 | Paper |
Communication is bounded by root of rank
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Non-malleable codes from additive combinatorics (extended abstract)
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
New bounds for matching vector families
SIAM Journal on Computing | 2015-02-09 | Paper |
On cryptography with auxiliary input
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Variety evasive sets
Computational Complexity | 2014-11-26 | Paper |
Correlation testing for affine invariant properties on \(\mathbb{F}_p^n\) in the high error regime
SIAM Journal on Computing | 2014-11-14 | Paper |
Almost \(k\)-wise vs. \(k\)-wise independent permutations, and uniformity for general group actions
Theory of Computing | 2014-10-06 | Paper |
Nontrivial \(t\)-designs over finite fields exist for all \(t\)
Journal of Combinatorial Theory. Series A | 2014-09-08 | Paper |
Every locally characterized affine-invariant property is testable
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
New bounds for matching vector families
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
New bounds for matching vector families
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
New Extension of the Weil Bound for Character Sums with Applications to Coding
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
En route to the log-rank conjecture: new reductions and equivalent formulations
Automata, Languages, and Programming | 2014-07-01 | Paper |
Correlation testing for affine invariant properties on F p n in the high error regime
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
The Freiman-Ruzsa theorem over finite fields
Journal of Combinatorial Theory. Series A | 2014-05-26 | Paper |
Probabilistic existence of rigid combinatorial structures
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Subspace evasive sets
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
A space lower bound for dynamic approximate membership data structures
SIAM Journal on Computing | 2014-04-11 | Paper |
Pseudorandom generators for \(\mathrm{CC}^0[p\) and the Fourier spectrum of low-degree polynomials over finite fields]
Computational Complexity | 2014-01-29 | Paper |
Equivalence of polynomial conjectures in additive combinatorics
Combinatorica | 2013-11-07 | Paper |
| Lower bounds for adaptive linearity tests | 2013-03-19 | Paper |
Bounded-depth circuits cannot sample good codes
Computational Complexity | 2012-12-07 | Paper |
Almost \(k\)-wise vs. \(k\)-wise independent permutations, and uniformity for general group actions
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Inverse conjecture for the Gowers norm is false
Theory of Computing | 2012-09-27 | Paper |
Computing polynomials with few multiplications
Theory of Computing | 2012-09-27 | Paper |
Random low-degree polynomials are hard to approximate
Computational Complexity | 2012-06-26 | Paper |
Higher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear forms
Geometric and Functional Analysis. GAFA | 2012-01-10 | Paper |
Correlation bounds for poly-size \(\mathrm{AC}^0\) circuits with \(n^{1 - o(1)}\) symmetric gates
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Unconditional pseudorandom generators for low degree polynomials
Theory of Computing | 2011-05-24 | Paper |
The complexity of Boolean functions in different characteristics
Computational Complexity | 2011-02-18 | Paper |
Pseudorandom Bit Generators That Fool Modular Sums
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Random Low Degree Polynomials are Hard to Approximate
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
| Inverse conjecture for the Gowers norm is false | 2009-01-05 | Paper |
| scientific article; zbMATH DE number 5485568 (Why is no real title available?) | 2009-01-05 | Paper |
ALMOST EUCLIDEAN SECTIONS OF THE N-DIMENSIONAL CROSS-POLYTOPE USING O(N) RANDOM BITS
Communications in Contemporary Mathematics | 2008-09-25 | Paper |
Explicit separations between randomized and deterministic Number-on-Forehead communication
(available as arXiv preprint) | N/A | Paper |
Strong bounds for skew corner-free sets
(available as arXiv preprint) | N/A | Paper |
