Stable distributions, pseudorandom generators, embeddings, and data stream computation
On the Power of Adaptivity in Sparse Recovery
Dynamic multidimensional histograms
Approximate nearest neighbors
Fast, small-space algorithms for approximate histogram maintenance
Space-optimal heavy hitters with strong error bounds
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC ’05
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Computational Geometry
Lecture Notes in Computer Science
ACM Transactions on Database Systems
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC ’02
Rajeev Motwani
Sudipto Guha
Martin J. Strauss
Eric Price
Mayur Datar
Yannis Kotidis
How robust are linear sketches to adaptive inputs?
Query-aware locality-sensitive hashing scheme for $$l_p$$ l p norm
Bypassing the embedding
A near-linear time ?-approximation algorithm for geometric bipartite matching
Beating CountSketch for heavy hitters in insertion streams