Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract)

DOI10.1007/978-3-540-79709-8_22zbMath1142.68331OpenAlexW79697912MaRDI QIDQ3503639

Sumit Ganguly

Publication date: 5 June 2008

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79709-8_22

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Data structures (68P05)

Related Items (4)

Buffered Count-Min Sketch on SSD: Theory and Experiments ⋮ Deterministic Heavy Hitters with Sublinear Query Time ⋮ Unnamed Item ⋮ Optimality of linear sketching under modular updates

This page was built for publication: Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract)