A randomized algorithm for finding frequent elements in streams using \(O(\log \log N)\) space (Q3104649)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A randomized algorithm for finding frequent elements in streams using O( N) space |
scientific article; zbMATH DE number 5988675
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A randomized algorithm for finding frequent elements in streams using \(O(\log \log N)\) space |
scientific article; zbMATH DE number 5988675 |
Statements
A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space (English)
0 references
16 December 2011
0 references
streaming algorithm
0 references
space complexity
0 references
0.8207122683525085
0 references
0.8146944642066956
0 references
0.8129950761795044
0 references
0.8125274777412415
0 references
