Applying approximate counting for computing the frequency moments of long data streams
From MaRDI portal
Publication:2272207
DOI10.1007/S00224-007-9048-ZzbMATH Open1179.68196OpenAlexW2034050626MaRDI QIDQ2272207FDOQ2272207
Authors: André Gronemeier, Martin Sauerhoff 
Publication date: 6 August 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-9048-z
Recommendations
- Optimal approximations of the frequency moments of data streams
- An improved data stream algorithm for frequency moments
- The space complexity of approximating the frequency moments
- scientific article; zbMATH DE number 1256715
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Cites Work
- Title not available (Why is that?)
- The space complexity of approximating the frequency moments
- Optimal approximations of the frequency moments of data streams
- Random sampling with a reservoir
- Title not available (Why is that?)
- Data streams: algorithms and applications.
- An information statistics approach to data stream and communication complexity
- Approximate counting: a detailed analysis
- Simpler algorithm for estimating frequency moments of data streams
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- An improved data stream algorithm for frequency moments
- Optimal space lower bounds for all frequency moments
- Counting large numbers of events in small registers
Cited In (4)
This page was built for publication: Applying approximate counting for computing the frequency moments of long data streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272207)
