Streaming Algorithms via Precision Sampling
From MaRDI portal
Publication:5494976
DOI10.1109/FOCS.2011.82zbMath1292.68186arXiv1011.1263MaRDI QIDQ5494976
Alexandr Andoni, Krzysztof Onak, Robert Krauthgamer
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.1263
Analysis of algorithms (68W40) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (14)
Taylor Polynomial Estimator for Estimating Frequency Moments ⋮ The Simultaneous Communication of Disjointness with Applications to Data Streams ⋮ Towards Optimal Moment Estimation in Streaming and Distributed Models ⋮ Towards Optimal Moment Estimation in Streaming and Distributed Models ⋮ Secure sampling with sublinear communication ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Sublinear Algorithms for MAXCUT and Correlation Clustering ⋮ Continuous Monitoring of l_p Norms in Data Streams ⋮ Deterministic Heavy Hitters with Sublinear Query Time ⋮ A general method for estimating correlated aggregates over a data stream ⋮ Quantum Chebyshev's Inequality and Applications ⋮ On Approximating Matrix Norms in Data Streams ⋮ Perfect $L_p$ Sampling in a Data Stream
This page was built for publication: Streaming Algorithms via Precision Sampling
