Fast, small-space algorithms for approximate histogram maintenance

DOI10.1145/509907.509966zbMATH Open1192.68962OpenAlexW2047424291MaRDI QIDQ3579236FDOQ3579236

Authors:

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)

Cited In (20)

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

This page was built for publication: Fast, small-space algorithms for approximate histogram maintenance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579236)