Approximate sparse recovery
Space-optimal heavy hitters with strong error bounds
Fast, small-space algorithms for approximate histogram maintenance
ACM Transactions on Database Systems
Proceedings of the 42nd ACM symposium on Theory of computing - STOC ’10
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC ’02
Anna C. Gilbert
Piotr Indyk
Radu Berinde
S. Muthukrishnan
Yi Li
Ely Porat
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Beating CountSketch for heavy hitters in insertion streams
Continuous matrix approximation on distributed data