Deterministically Estimating Data Stream Frequencies

DOI10.1007/978-3-642-02026-1_28MaRDI QIDQ3637077zbMATH OpenOpenAlexFDO

Authors Sumit Ganguly

Publication date 7 July 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02026-1_28

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On Estimating Frequency Moments of Data Streams
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Estimating hybrid frequency moments of data streams
• Optimal approximations of the frequency moments of data streams
• Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract)
• Dynamically computing approximate frequency counts in sliding window over data stream
• Applying approximate counting for computing the frequency moments of long data streams
• An improved data stream algorithm for frequency moments
• Revisiting frequency moment estimation in random order streams
• Estimating Hybrid Frequency Moments of Data Streams

Cited in

(5)

• Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract)
• Precision vs confidence tradeoffs for \(\ell_2\)-based frequency estimation in data streams
• Continuous monitoring of _p norms in data streams
• A Framework for Adversarially Robust Streaming Algorithms
• Perfect \(L_p\) sampling in a data stream

This page was built for publication: Deterministically Estimating Data Stream Frequencies

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