Fast, small-space algorithms for approximate histogram maintenance

DOI10.1145/509907.509966zbMath1192.68962MaRDI QIDQ3579236

No author found.

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/509907.509966

Mathematics Subject Classification ID

68W40: Analysis of algorithms

90B25: Reliability, availability, maintenance, inspection in operations research

Related Items

Fast Private Norm Estimation and Heavy Hitters, Adapting parallel algorithms to the W-stream model, with applications to graph problems, Streaming techniques and data aggregation in networks of tiny artefacts, An information statistics approach to data stream and communication complexity, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, Private multiparty sampling and approximation of vector combinations, Multiple pass streaming algorithms for learning mixtures of distributions in \(\mathbb R^d\), Finding frequent items in data streams, Comment: Monitoring networked applications with incremental quantile estimation, Derandomized constructions of \(k\)-wise (almost) independent permutations, Finding longest increasing and common subsequences in streaming data, On graph problems in a semi-streaming model, Compressed sensing and best 𝑘-term approximation, Book Review: A mathematical introduction to compressive sensing, Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$