ACM - Normas
Vladimir Braverman
Stephen R. Chestnut
David P. Woodruff
Nikita Ivkin
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016
A simple algorithm for finding frequent elements in streams and bags
algorithms and techniques, August 17-19, 2011, Princeton, NJ
Tight bounds for Lp samplers, finding duplicates in streams, and related problems
The Data Stream Space Complexity of Cascaded Norms
Optimal approximations of the frequency moments of data streams
Stable distributions, pseudorandom generators, embeddings, and data stream computation