@InProceedings{braverman_et_al:LIPIcs.APPROX-RANDOM.2014.531,
author = {Braverman, Vladimir and Katzman, Jonathan and Seidell, Charles and Vorsanger, Gregory},
title = {{An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {531--544},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.531},
URN = {urn:nbn:de:0030-drops-47217},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.531},
annote = {Keywords: Streaming Algorithms, Randomized Algorithms, Frequency Moments, Heavy Hitters}
}