| Publication | Date of Publication | Type |
|---|
| How many neurons does it take to approximate the maximum? | 2024-11-28 | Paper |
| scientific article; zbMATH DE number 7829330 (Why is no real title available?) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7788363 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| Improving Pearson's chi-squared test: hypothesis testing of distributions -- optimally | 2023-10-13 | Paper |
| Instance Optimal Distribution Testing and Learning | 2022-02-04 | 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 |
Testing \(k\)-modal distributions: optimal algorithms via reductions
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| The shifting sands algorithm | 2019-05-10 | 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 |
Instance optimal learning of discrete distributions
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Eroding dipoles and vorticity growth for Euler flows in \(\mathbb{R}^{3}\): axisymmetric flow without swirl
Journal of Fluid Mechanics | 2017-08-04 | Paper |
Eroding dipoles and vorticity growth for Euler flows in \(\mathbb{R}^{3}\): axisymmetric flow without swirl
Journal of Fluid Mechanics | 2017-08-04 | Paper |
An automatic inequality prover and instance optimal identity testing
SIAM Journal on Computing | 2017-03-10 | Paper |
Evolvability of real functions
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Distribution free evolvability of polynomial functions over all convex loss functions
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
| The approximation complexity of win-lose games | 2014-12-18 | 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 |
Testing Symmetric Properties of Distributions
SIAM Journal on Computing | 2012-03-15 | Paper |
The log-rank conjecture and low degree polynomials
Information Processing Letters | 2009-07-09 | Paper |
| scientific article; zbMATH DE number 5485550 (Why is no real title available?) | 2009-01-05 | Paper |
Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
Theory of Cryptography | 2008-03-05 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Polynomial Representations of Symmetric Partial Boolean Functions
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Linear bounds on the North-East model and higher-dimensional analogs
Advances in Applied Mathematics | 2004-10-12 | Paper |
