An optimal algorithm for large frequency moments using \(O(n^{1-2/k})\) bits (Q2969645)
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: An optimal algorithm for large frequency moments using O(n^1-2/k) bits |
scientific article; zbMATH DE number 6696528
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm for large frequency moments using \(O(n^{1-2/k})\) bits |
scientific article; zbMATH DE number 6696528 |
Statements
22 March 2017
0 references
streaming algorithms
0 references
randomized algorithms
0 references
frequency moments
0 references
heavy hitters
0 references
An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits (English)
0 references
0.8882994651794434
0 references
0.8791661858558655
0 references
0.878737211227417
0 references
0.8483912944793701
0 references
0.844260036945343
0 references
