| Publication | Date of Publication | Type |
|---|
Product Mixing in Compact Lie Groups
(available as arXiv preprint) | N/A | Paper |
Constant Degree Direct Product Testers with Small Soundness
(available as arXiv preprint) | N/A | Paper |
A Dense Model Theorem for the Boolean Slice
(available as arXiv preprint) | N/A | Paper |
Parallel repetition for the \textsf{GHZ} game: exponential decay
SIAM Journal on Computing | 2026-07-08 | Paper |
On approximability of satisfiable k-CSPs: V
TheoretiCS | 2026-05-28 | Paper |
| Theorems of KKL, Friedgut, and Talagrand via random restrictions and log-Sobolev inequality | 2026-04-15 | Paper |
| On rich 2-to-1 games | 2026-04-15 | Paper |
Towards a proof of the 2-to-1 games conjecture
Theory of Computing | 2026-02-10 | Paper |
On independent sets, 2-to-2 games and Grassmann graphs
Theory of Computing | 2026-02-10 | Paper |
Small-set expansion in the Johnson graph
Theory of Computing | 2026-02-10 | Paper |
| Solving unique games over globally hypercontractive graphs | 2026-01-28 | Paper |
On approximability of satisfiable k-CSPs: II
Combinatorics, Probability and Computing | 2025-12-30 | Paper |
An invariance principle for the multi-slice, with applications
Advances in Mathematics | 2025-11-17 | Paper |
| Parallel repetition of k-player projection games | 2025-10-06 | Paper |
Isoperimetric inequalities made simpler
Discrete Analysis | 2025-09-19 | Paper |
Effective bounds for restricted \(3\)-arithmetic progressions in \(\mathbb{F}_p^n\)
Discrete Analysis | 2025-09-12 | Paper |
On approximability of satisfiable k-CSPs. I
Computational Complexity | 2025-08-25 | Paper |
| Parallel repetition for the GHZ game: exponential decay | 2025-08-15 | Paper |
| Optimal testing of generalized Reed-muller codes in fewer queries | 2025-08-15 | Paper |
| Improved optimal testing results from global hypercontractivity | 2025-08-15 | Paper |
| An invariance principle for the multi-slice, with applications | 2025-08-13 | Paper |
| Towards a proof of the Fourier-entropy conjecture? | 2025-08-12 | Paper |
| Noise sensitivity on the p-biased hypercube | 2025-08-12 | Paper |
| Pseudorandom sets in Grassmann graph have near-perfect expansion | 2025-08-12 | Paper |
| On monotonicity testing and Boolean isoperimetric type theorems | 2025-08-05 | Paper |
Turán problems for expanded hypergraphs
Combinatorica | 2025-07-25 | Paper |
Improved optimal testing results from global hypercontractivity
SIAM Journal on Computing | 2025-06-25 | Paper |
| NP-hardness of almost coloring almost 3-colorable graphs | 2025-01-14 | Paper |
| Adversarial low degree testing | 2024-11-28 | Paper |
On perfectly friendly bisections of random graphs
The Annals of Probability | 2024-11-07 | Paper |
| Improved monotonicity testers via hypercube embeddings | 2024-09-25 | Paper |
| Rounding via low dimensional embeddings | 2024-09-25 | Paper |
On the largest product-free subsets of the alternating groups
Inventiones Mathematicae | 2024-08-12 | Paper |
| Expander random walks: the general case and limitations | 2024-06-24 | Paper |
| Approaching the soundness barrier: a near optimal analysis of the cube versus cube test | 2024-05-14 | Paper |
| On approximability of satisfiable k-CSPs. II | 2024-05-08 | Paper |
| On approximability of satisfiable k-CSPs. III | 2024-05-08 | Paper |
Hypercontractivity on the symmetric group
Forum of Mathematics, Sigma | 2024-01-18 | Paper |
Forbidden intersections for codes
Journal of the London Mathematical Society | 2023-12-19 | Paper |
Approximate polymorphisms
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
On approximability of satisfiable <i>k</i> -CSPs: I
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
New separations results for external information
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Hypercontractivity for global functions and sharp thresholds
Journal of the American Mathematical Society | 2023-10-19 | Paper |
| Effective Bounds for Restricted $3$-Arithmetic Progressions in $\mathbb{F}_p^n$ | 2023-08-12 | Paper |
| On Approximability of Satisfiable k-CSPs: IV | 2023-07-30 | Paper |
| Influences in Mixing Measures | 2023-07-14 | Paper |
Optimal tiling of the euclidean space using permutation-symmetric bodies
(available as arXiv preprint) | 2023-07-12 | Paper |
Pseudorandom sets in Grassmann graph have near-perfect expansion
Annals of Mathematics. Second Series | 2023-05-31 | Paper |
| On Perfectly Friendly Bisections of Random Graphs | 2023-05-05 | Paper |
| On t-Intersecting Families of Permutations | 2023-03-28 | Paper |
| On Monotonicity Testing and the 2-to-2 Games Conjecture | 2023-01-31 | Paper |
| Improved Monotonicity Testers via Hypercube Embeddings | 2022-11-16 | Paper |
| On the Largest Product-free Subsets of the Alternating Groups | 2022-05-30 | Paper |
| Isoperimetric Inequalities Made Simpler | 2022-04-13 | Paper |
| Improved Optimal Testing Results from Global Hypercontractivity | 2022-02-17 | Paper |
Pandemic spread in communities via random graphs
Journal of Statistical Mechanics: Theory and Experiment | 2021-11-19 | Paper |
| An Invariance Principle for the Multi-slice, with Applications | 2021-10-20 | Paper |
On non-optimally expanding sets in Grassmann graphs
Israel Journal of Mathematics | 2021-08-24 | Paper |
| Global hypercontractivity and its applications | 2021-03-08 | Paper |
Can Distributed Uniformity Testing Be Local?
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
AND testing and robust judgement aggregation
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Pandemic Spread in Communities via Random Graphs
(available as arXiv preprint) | 2021-01-13 | Paper |
Towards a proof of the Fourier-entropy conjecture?
Geometric and Functional Analysis. GAFA | 2020-12-16 | Paper |
AND Testing and Robust Judgement Aggregation
(available as arXiv preprint) | 2019-10-31 | Paper |
Towards a proof of the 2-to-1 games conjecture?
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
On non-optimally expanding sets in Grassmann graphs
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
On Monotonicity Testing and Boolean Isoperimetric-type Theorems
SIAM Journal on Computing | 2018-12-19 | Paper |
On independent sets, 2-to-2 games, and Grassmann graphs
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
