Fast, small-space algorithms for approximate histogram maintenance
From MaRDI portal
Publication:3579236
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
- Private multiparty sampling and approximation of vector combinations
- scientific article; zbMATH DE number 7053292 (Why is no real title available?)
- 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\)
- Streaming techniques and data aggregation in networks of tiny artefacts
- Comment: Monitoring networked applications with incremental quantile estimation
- 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)
