| Publication | Date of Publication | Type |
|---|
| Sharp noisy binary search with monotonic probabilities | 2026-01-14 | Paper |
| Factorial lower bounds for (almost) random order streams | 2025-08-15 | Paper |
| The sketching complexity of graph and hypergraph counting | 2025-08-12 | Paper |
| Robust polynomial regression up to the information theoretic limit | 2025-08-06 | Paper |
| Fourier-sparse interpolation without a frequency gap | 2025-08-06 | Paper |
| A robust sparse Fourier transform in the continuous setting | 2025-08-05 | Paper |
| Compressed sensing with adversarial sparse noise via L1 regression | 2024-08-26 | Paper |
| Simulating random walks in random streams | 2024-07-19 | Paper |
| An improved online reduction from PAC learning to mistake-bounded learning | 2024-05-14 | Paper |
L1 Regression with Lewis Weights Subsampling
(available as arXiv preprint) | 2023-11-20 | Paper |
Optimal testing of discrete distributions with high probability
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Near-optimal learning of tree-structured distributions by Chow-Liu
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
scientific article; zbMATH DE number 7758315 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
scientific article; zbMATH DE number 7711619 (Why is no real title available?)
(available as arXiv preprint) | 2023-07-12 | Paper |
Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu
SIAM Journal on Computing | 2023-07-06 | Paper |
| Finite-Sample Symmetric Mean Estimation with Fisher Information Rate | 2023-06-28 | Paper |
Fast splitting algorithms for sparsity-constrained and noisy group testing
Information and Inference: A Journal of the IMA | 2023-05-23 | Paper |
| High-dimensional Location Estimation via Norm Concentration for Subgamma Vectors | 2023-02-05 | Paper |
Optimal non-adaptive probabilistic group testing in general sparsity regimes
Information and Inference: A Journal of the IMA | 2022-10-24 | Paper |
scientific article; zbMATH DE number 7561529 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| Sparse Recovery | 2022-02-04 | Paper |
Sample-optimal identity testing with high probability
(available as arXiv preprint) | 2021-07-28 | Paper |
| Testing hereditary properties of sequences | 2021-07-28 | Paper |
Separations and equivalences between turnstile streaming and linear sketching
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Optimal Non-Adaptive Probabilistic Group Testing in General Sparsity Regimes
(available as arXiv preprint) | 2020-06-01 | Paper |
Fast regression with an \(\ell_{\infty}\) guarantee
(available as arXiv preprint) | 2020-05-27 | Paper |
Adaptive sparse recovery with limited adaptivity
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Collision-based Testers are Optimal for Uniformity and Closeness
Chicago Journal of Theoretical Computer Science | 2019-09-12 | Paper |
(Nearly) sample-optimal sparse Fourier transform
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
New constructions of RIP matrices with fast multiplication and fewer rows
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Improved concentration bounds for count-sketch
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Lower bounds for adaptive sparse recovery
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| scientific article; zbMATH DE number 7053345 (Why is no real title available?) | 2019-05-10 | Paper |
A hybrid sampling scheme for triangle counting
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Efficient sketches for the set query problem | 2017-09-29 | Paper |
Efficient sketches for the set query problem
(available as arXiv preprint) | 2017-09-29 | Paper |
Tight bounds for learning a mixture of two Gaussians (extended abstract)
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Trace reconstruction revisited
Algorithms - ESA 2014 | 2014-10-08 | Paper |
On the Power of Adaptivity in Sparse Recovery
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
(1 + eps)-Approximate Sparse Recovery
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Lower bounds for sparse recovery
(available as arXiv preprint) | 2014-05-22 | Paper |
Nearly optimal sparse Fourier transform
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Compressive sensing with local geometric features
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Compressive sensing with local geometric features
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Confluently persistent tries for efficient version control
Algorithmica | 2010-05-19 | Paper |
Confluently Persistent Tries for Efficient Version Control
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
