OpenAlex | An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits

An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits

Work

Year: 2014

Type: article

Source: International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Authors Vladimir Braverman, Jonathan Katzman, Charles Seidell, Gregory Vorsanger

Institution Johns Hopkins University

Cites:

Cited by: 18

Related to: 20

FWCI: 1.578

Citation percentile (by year/subfield): 75.78

Topic: Algorithms and Data Compression

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed