| Publication | Date of Publication | Type |
|---|
The story of sunflowers
Journal of the London Mathematical Society. Second Series | 2026-02-02 | Paper |
| Direct products in communication complexity | 2025-05-20 | Paper |
| Formulas resilient to short-circuit errors | 2025-05-05 | Paper |
| Pseudorandom generators for regular branching programs | 2025-04-29 | Paper |
| Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits | 2022-07-21 | Paper |
Anticoncentration and the Exact Gap-Hamming Problem
SIAM Journal on Discrete Mathematics | 2022-05-10 | Paper |
Anti-concentration and the Exact Gap-Hamming Problem
(available as arXiv preprint) | 2022-01-04 | Paper |
| Tight bounds on the Fourier growth of bounded functions on the hypercube | 2021-07-13 | Paper |
| Online Discrepancy Minimization via Persistent Self-Balancing Walks | 2021-02-04 | Paper |
| An Elementary Exposition of Pisier's Inequality | 2020-09-22 | Paper |
| Communication Complexity | 2020-02-04 | Paper |
| Anti-concentration in most directions | 2018-11-15 | Paper |
| Simplified lower bounds on the multiparty communication complexity of disjointness | 2018-01-24 | Paper |
| Circuits with medium fan-in | 2018-01-24 | Paper |
Information Equals Amortized Communication
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Toward coding for maximum errors in interactive communication
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Restriction access
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Deterministic extractors for small-space sources
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Pseudorandom generators for regular branching programs
SIAM Journal on Computing | 2014-09-18 | Paper |
How to compress interactive communication
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Information Equals Amortized Communication
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Towards coding for maximum errors in interactive communication
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
How to compress interactive communication
SIAM Journal on Computing | 2013-09-25 | Paper |
Direct product via round-preserving compression
Automata, Languages, and Programming | 2013-08-06 | Paper |
2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
Annals of Mathematics. Second Series | 2013-01-03 | Paper |
Parallel repetition in projection games and a concentration bound
SIAM Journal on Computing | 2012-03-15 | Paper |
Deterministic extractors for small-space sources
Journal of Computer and System Sciences | 2011-01-18 | Paper |
Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
SIAM Journal on Computing | 2010-03-17 | Paper |
Strong Parallel Repetition Theorem for Free Projection Games
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
| scientific article; zbMATH DE number 5485509 (Why is no real title available?) | 2009-01-05 | Paper |
A 2-Source Almost-Extractor for Linear Entropy
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Extractors for Three Uneven-Length Sources
Lecture Notes in Computer Science | 2008-11-27 | Paper |
