Fast, small-space algorithms for approximate histogram maintenance

DOI10.1145/509907.509966zbMath1192.68962OpenAlexW2047424291MaRDI 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

Analysis of algorithms (68W40) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items

Finding frequent items in data streams, Book Review: A mathematical introduction to compressive sensing, Comment: Monitoring networked applications with incremental quantile estimation, Derandomized constructions of \(k\)-wise (almost) independent permutations, An information statistics approach to data stream and communication complexity, Adapting parallel algorithms to the W-stream model, with applications to graph problems, Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$, Summarizing numeric spatial data streams by trend cluster discovery, Challenges in benchmarking stream learning algorithms with real-world data, Streaming techniques and data aggregation in networks of tiny artefacts, Finding longest increasing and common subsequences in streaming data, Fast Private Norm Estimation and Heavy Hitters, Compressed sensing and best 𝑘-term approximation, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, Private multiparty sampling and approximation of vector combinations, Discovering and Exploiting Statistical Properties for Query Optimization in Relational Databases: A Survey, Multiple pass streaming algorithms for learning mixtures of distributions in \(\mathbb R^d\), On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy, Unnamed Item, On graph problems in a semi-streaming model