| Publication | Date of Publication | Type |
|---|
| Random restrictions and PRGs for PTFs in Gaussian space | 2024-07-05 | Paper |
| Smoothed analysis of the Komlós conjecture | 2024-06-24 | Paper |
| Efficient resilient functions | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7829245 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
| scientific article; zbMATH DE number 7829336 (Why is no real title available?) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7788507 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| Pseudorandom Generators for Read-Once Monotone Branching Programs | 2023-11-20 | Paper |
| Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank | 2022-08-23 | Paper |
| Smoothed Analysis of the Koml\'os Conjecture | 2022-04-25 | Paper |
Approximating rectangles by juntas and weakly exponential lower bounds for LP relaxations of CSPs
SIAM Journal on Computing | 2021-06-22 | Paper |
On the discrepancy of random low degree set systems
Random Structures & Algorithms | 2020-11-30 | Paper |
On the discrepancy of random low degree set systems
Random Structures & Algorithms | 2020-11-30 | Paper |
Pseudorandom generators for width-3 branching programs
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Pseudorandomness from shrinkage
Journal of the ACM | 2019-11-21 | Paper |
On the discrepancy of random low degree set systems
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Pseudorandomness via the discrete Fourier transform
SIAM Journal on Computing | 2018-12-19 | Paper |
Explicit Resilient Functions Matching Ajtai-Linial
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Communication With Imperfectly Shared Randomness
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Communication with imperfectly shared randomness
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
| Deterministic coupon collection and better strong dispersers | 2017-03-22 | Paper |
Anti-concentration for polynomials of independent random variables
Theory of Computing | 2016-11-01 | Paper |
Rectangles are nonnegative juntas
SIAM Journal on Computing | 2016-10-28 | Paper |
Constructive discrepancy minimization by walking on the edges
SIAM Journal on Computing | 2015-11-04 | Paper |
Making the Long Code Shorter
SIAM Journal on Computing | 2015-11-04 | Paper |
Sum-of-squares Lower Bounds for Planted Clique
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Almost Optimal Pseudorandom Generators for Spherical Caps
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
A polynomial time approximation scheme for computing the supremum of Gaussian processes
The Annals of Applied Probability | 2015-04-27 | Paper |
A polynomial time approximation scheme for computing the supremum of Gaussian processes
The Annals of Applied Probability | 2015-04-27 | Paper |
Bounding the sensitivity of polynomial threshold functions
Theory of Computing | 2014-10-06 | Paper |
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
An invariance principle for polytopes
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Pseudorandom generators for polynomial threshold functions
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
A PRG for Lipschitz functions of polynomials with applications to sparsest cut
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
An FPTAS for #Knapsack and Related Counting Problems
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Fast pseudorandomness for independence and load balancing (extended abstract)
Automata, Languages, and Programming | 2014-07-01 | Paper |
Pseudorandom generators for combinatorial shapes
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
An invariance principle for polytopes
Journal of the ACM | 2014-02-17 | Paper |
Pseudorandom generators for combinatorial shapes
SIAM Journal on Computing | 2013-09-25 | Paper |
Pseudorandom generators for polynomial threshold functions
SIAM Journal on Computing | 2013-09-25 | Paper |
| Association schemes, non-commutative polynomial concentration, and sum-of-squares lower bounds for planted clique | 2013-07-29 | Paper |
DNF sparsification and a faster deterministic counting algorithm
Computational Complexity | 2013-07-19 | Paper |
Almost Optimal Explicit Johnson-Lindenstrauss Families
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Almost Optimal Explicit Johnson-Lindenstrauss Families
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Small-Bias Spaces for Group Products
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Strong Bounds for 3-Progressions
(available as arXiv preprint) | N/A | Paper |
Explicit separations between randomized and deterministic Number-on-Forehead communication
(available as arXiv preprint) | N/A | Paper |
