An improved data stream algorithm for frequency moments
From MaRDI portal
Recommendations
- Optimal approximations of the frequency moments of data streams
- An optimal algorithm for large frequency moments using \(O(n^{1-2/k})\) bits
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Optimal space lower bounds for all frequency moments
- Applying approximate counting for computing the frequency moments of long data streams
Cited in
(18)- Zero-one frequency laws
- In-network estimation of frequency moments
- Fast moment estimation in data streams in optimal space
- Deterministically Estimating Data Stream Frequencies
- Optimal sampling from sliding windows
- Data Stream Algorithms via Expander Graphs
- Hierarchical sampling from sketches: Estimating functions over data streams
- Applying approximate counting for computing the frequency moments of long data streams
- An optimal algorithm for large frequency moments using \(O(n^{1-2/k})\) bits
- Optimal space lower bounds for all frequency moments
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Universal sketches for the frequency negative moments and other decreasing streaming sums
- The value of multiple read/write streams for approximating frequency moments
- High probability frequency moment sketches
- Optimal approximations of the frequency moments of data streams
- Sublinear-time algorithms for counting star subgraphs via edge sampling
- The Simultaneous Communication of Disjointness with Applications to Data Streams
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
This page was built for publication: An improved data stream algorithm for frequency moments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501253)
