Testing that distributions are close
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Testing Random Variables for Independence and Identity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Sublinear algorithms for testing monotone and unimodal distributions
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The Complexity of Approximating the Entropy
SIAM Journal on Computing
Testing symmetric properties of distributions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Sublinear estimation of entropy and information distances
ACM Transactions on Algorithms (TALG)
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem
SIAM Journal on Computing
Sublinear Time Algorithms for Earth Mover’s Distance
Theory of Computing Systems
Proceedings of the forty-third annual ACM symposium on Theory of computing
The Power of Linear Estimators
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Estimating entropy on m bins given fewer than m samples
IEEE Transactions on Information Theory
A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data
IEEE Transactions on Information Theory
Testing Symmetric Properties of Distributions
SIAM Journal on Computing
| Hi-index | 0.00 |
New algorithms for estimating parameters of distributions over big domains need significantly fewer samples.