Sampling lower bounds via information theory
An information statistics approach to data stream and communication complexity
Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC ’03
Journal of Computer and System Sciences
Ravi Kumar
D. Sivakumar
T.S. Jayram
Streaming symmetric norms via measure concentration
Fast monte-carlo algorithms for finding low-rank approximations
Beating CountSketch for heavy hitters in insertion streams