On Finding Frequent Elements in a Data Stream
From MaRDI portal
Publication:3603495
DOI10.1007/978-3-540-74208-1_42zbMath1171.68489OpenAlexW1582057136MaRDI QIDQ3603495
Publication date: 17 February 2009
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74208-1_42
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of data (68P99)
This page was built for publication: On Finding Frequent Elements in a Data Stream