A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space

DOI10.1007/978-3-642-25591-5_53zbMath1350.68286OpenAlexW1522705574MaRDI QIDQ3104649

Masatora Ogata, Shuji Kijima, Yukiko Yamauchi, Masafumi Yamashita

Publication date: 16 December 2011

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25591-5_53

zbMATH Keywords

space complexitystreaming algorithm

Mathematics Subject Classification ID

Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (2)

On Space and Time Complexity of Loosely-Stabilizing Leader Election ⋮ Randomized counter-based algorithms for frequency estimation over data streams in \(O(\log \log N)\) space

This page was built for publication: A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space