Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream

DOI10.1007/978-3-540-78773-0_60zbMath1136.68620OpenAlexW1479907940MaRDI QIDQ5458572

No author found.

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_60

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Randomized algorithms (68W20)

Related Items (3)

Succinct summing over sliding windows ⋮ Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. ⋮ How to catch \(L_2\)-heavy-hitters on sliding windows

This page was built for publication: Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream