Sketching and Embedding are Equivalent for Norms
Approximate near neighbors for general symmetric norms
Data-dependent hashing via nonlinear spectral gaps
Streaming Algorithms via Precision Sampling
Tight Lower Bound for Linear Sketches of Moments
Lecture Notes in Computer Science
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing - STOC ’15
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017
Ilya Razenshteyn
Erik Waingarten
Aleksandar Nikolov
Huy L. Nguyen
Robert Krauthgamer
Yihong Wu
Streaming symmetric norms via measure concentration
Beating CountSketch for heavy hitters in insertion streams