| Publication | Date of Publication | Type |
|---|
Linear space streaming lower bounds for approximating CSPs
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Pure differentially private summation from anonymous messages
(available as arXiv preprint) | 2023-11-02 | Paper |
Private aggregation from fewer anonymous messages
(available as arXiv preprint) | 2022-03-23 | Paper |
| On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy | 2021-12-08 | Paper |
| Streaming complexity of approximating Max 2CSP and Max Acyclic Subgraph | 2021-07-28 | Paper |
Oblivious Sketching of High-Degree Polynomial Kernels
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
A universal sampling method for reconstructing signals with simple Fourier transforms
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Dimension-independent sparse Fourier transform
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Restricted isometry of Fourier matrices and list decodability of random linear codes
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
(1 + (1))-approximation to MAX-CUT requires linear space
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Bridging the capacity gap between interactive and one-way communication
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| On the sensitivity conjecture for read-k formulas | 2018-03-21 | Paper |
An entropy sumset inequality and polynomially fast convergence to Shannon capacity over all alphabets
(available as arXiv preprint) | 2018-01-24 | Paper |
Limitations on Testable Affine-Invariant Codes in the High-Rate Regime
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Communication with partial noiseless feedback | 2017-08-31 | Paper |
Shift lifts preserving Ramanujan property
Linear Algebra and its Applications | 2017-06-30 | Paper |
Approximating nearest neighbor distances
Lecture Notes in Computer Science | 2015-10-30 | Paper |
| Towards Constructing Ramanujan Graphs Using Shift Lifts | 2015-02-25 | Paper |
A fast algorithm for well-spaced points and approximate Delaunay graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Towards Constructing Ramanujan Graphs Using Shift Lifts
(available as arXiv preprint) | 2015-01-01 | Paper |
Restricted isometry of Fourier matrices and list decodability of random linear codes
SIAM Journal on Computing | 2014-02-04 | Paper |
Restricted isometry of Fourier matrices and list decodability of random linear codes
SIAM Journal on Computing | 2014-02-04 | Paper |
