Streaming symmetric norms via measure concentration

DOI10.1145/3055399.3055424zbMath1369.68205arXiv1511.01111OpenAlexW2111405401MaRDI QIDQ4978018

Robert Krauthgamer, Lin F. Yang, Vladimir Braverman, Jarosław Błasiok, Stephen R. Chestnut

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.01111

zbMATH Keywords

data streamsymmetric normspace complexitylinear sketchturnstile model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (5)

Sketching and Embedding are Equivalent for Norms ⋮ Unnamed Item ⋮ Symmetric norm estimation and regression on sliding windows ⋮ Continuous Monitoring of l_p Norms in Data Streams ⋮ Almost-smooth histograms and sliding-window graph algorithms

This page was built for publication: Streaming symmetric norms via measure concentration