| Publication | Date of Publication | Type |
|---|
| Matrix multiplication in quadratic time and energy? Towards a fine-grained energy-centric church-Turing thesis | 2025-11-04 | Paper |
| Satisfiability and evolution | 2025-08-05 | Paper |
| An automatic inequality prover and instance optimal identity testing | 2025-08-05 | Paper |
| Finding correlations in subquadratic time, with applications to learning parities and juntas | 2025-05-05 | Paper |
| Settling the polynomial learnability of mixtures of Gaussians | 2025-04-29 | Paper |
Efficient convex optimization requires superlinear memory
Journal of the ACM | 2025-04-25 | Paper |
On the statistical complexity of sample amplification
The Annals of Statistics | 2025-01-29 | Paper |
| Online pen testing | 2024-09-25 | Paper |
Stronger calibration lower bounds via sidestepping
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Instance Optimal Distribution Testing and Learning | 2022-02-04 | Paper |
Resilience: a criterion for learning in the presence of arbitrary outliers
(available as arXiv preprint) | 2021-06-15 | Paper |
Learning discrete distributions from untrusted batches
(available as arXiv preprint) | 2021-06-15 | Paper |
Recovering structured probability matrices
(available as arXiv preprint) | 2021-06-15 | Paper |
Memory-sample tradeoffs for linear regression with small error
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Prediction with a short memory
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Optimal algorithms for testing closeness of discrete distributions
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Optimal algorithms for testing closeness of discrete distributions
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Learning sparse polynomial functions
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Testing \(k\)-modal distributions: optimal algorithms via reductions
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| On the complexity of Nash equilibria of action-graph games | 2019-05-06 | Paper |
Estimating the unseen, improved estimators for entropy and other properties
Journal of the ACM | 2018-05-17 | Paper |
| Stochastic streams: sample complexity vs. space complexity | 2018-03-02 | Paper |
Spectrum estimation from samples
The Annals of Statistics | 2017-12-22 | Paper |
Instance optimal learning of discrete distributions
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Learning from untrusted data
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
An automatic inequality prover and instance optimal identity testing
SIAM Journal on Computing | 2017-03-10 | Paper |
Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
Journal of the ACM | 2016-03-24 | Paper |
Efficiently learning mixtures of two Gaussians
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
The Power of Linear Estimators
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Estimating the unseen, an \(n/\log(n)\)-sample estimator for entropy and support size, shown optimal via new CLTs
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Size and treewidth bounds for conjunctive queries
Journal of the ACM | 2014-02-17 | Paper |
Braess's Paradox in large random graphs
Random Structures & Algorithms | 2010-12-14 | Paper |
Designing network protocols for good equilibria
SIAM Journal on Computing | 2010-11-04 | Paper |
On learning algorithms for Nash equilibria
Algorithmic Game Theory | 2010-10-19 | Paper |
| scientific article; zbMATH DE number 5764861 (Why is no real title available?) | 2010-08-06 | Paper |
