| 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 |
| https://portal.mardi4nfdi.de/entity/Q6126236 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126349 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147427 | 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 | 2021-06-22 | Paper |
| On the discrepancy of random low degree set systems | 2020-11-30 | Paper |
| Pseudorandom generators for width-3 branching programs | 2020-01-30 | Paper |
| Pseudorandomness from Shrinkage | 2019-11-21 | Paper |
| On the discrepancy of random low degree set systems | 2019-10-15 | Paper |
| Pseudorandomness via the discrete Fourier transform | 2018-12-19 | Paper |
| Explicit Resilient Functions Matching Ajtai-Linial | 2018-07-16 | Paper |
| Communication With Imperfectly Shared Randomness | 2018-06-27 | Paper |
| Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs | 2017-08-17 | Paper |
| Communication with imperfectly shared randomness | 2017-05-19 | Paper |
| Deterministic coupon collection and better strong dispersers | 2017-03-22 | Paper |
| Anti-concentration for polynomials of independent random variables | 2016-11-01 | Paper |
| Rectangles are nonnegative juntas | 2016-10-28 | Paper |
| Constructive discrepancy minimization by walking on the edges | 2015-11-04 | Paper |
| Making the Long Code Shorter | 2015-11-04 | Paper |
| Sum-of-squares Lower Bounds for Planted Clique | 2015-08-21 | Paper |
| Almost Optimal Pseudorandom Generators for Spherical Caps | 2015-08-21 | Paper |
| A polynomial time approximation scheme for computing the supremum of Gaussian processes | 2015-04-27 | Paper |
| Bounding the sensitivity of polynomial threshold functions | 2014-10-06 | Paper |
| Pseudorandom generators for polynomial threshold functions | 2014-08-13 | Paper |
| Bounding the average sensitivity and noise sensitivity of polynomial threshold functions | 2014-08-13 | Paper |
| An invariance principle for polytopes | 2014-08-13 | Paper |
| A PRG for Lipschitz functions of polynomials with applications to sparsest cut | 2014-08-07 | Paper |
| An FPTAS for #Knapsack and Related Counting Problems | 2014-07-30 | Paper |
| Fast pseudorandomness for independence and load balancing (extended abstract) | 2014-07-01 | Paper |
| Pseudorandom generators for combinatorial shapes | 2014-06-05 | Paper |
| An invariance principle for polytopes | 2014-02-17 | Paper |
| Pseudorandom generators for polynomial threshold functions | 2013-09-25 | Paper |
| Pseudorandom generators for combinatorial shapes | 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 | 2013-07-19 | Paper |
| Almost Optimal Explicit Johnson-Lindenstrauss Families | 2011-08-17 | Paper |
| Small-Bias Spaces for Group Products | 2009-10-28 | Paper |
| Strong Bounds for 3-Progressions | N/A | Paper |
| Explicit separations between randomized and deterministic Number-on-Forehead communication | N/A | Paper |
