Approximate near neighbors for general symmetric norms
Tight Lower Bound for Linear Sketches of Moments
Turnstile streaming algorithms might as well be linear sketches
OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace Embeddings
Lecture Notes in Computer Science
2013 IEEE 54th Annual Symposium on Foundations of Computer Science
Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC ’14
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017
Alexandr Andoni
Erik Waingarten
Aleksandar Nikolov
Yihong Wu
Yury Polyanskiy
David P. Woodruff
Streaming symmetric norms via measure concentration
Toward a Unified Theory of Sparse Dimensionality Reduction in Euclidean Space
Beating CountSketch for heavy hitters in insertion streams