@inproceedings{4b2b9dd4cb00481ea25c24bc8d05603d,
title = "Fast moment estimation in data streams in optimal space",
abstract = "We give a space-optimal streaming algorithm with update time O(log 2(1/ε)loglog(1/ε)) for approximating the pth frequency moment, 0 < p < 2, of a length-n vector updated in a data stream up to a factor of 1 ± ε. This provides a nearly exponential improvement over the previous space optimal algorithm of [Kane-Nelson-Woodruff, SODA 2010], which had update time Ω(1/ε2). When combined with the work of [Harvey-Nelson-Onak, FOCS 2008], we also obtain the first algorithm for entropy estimation in turnstile streams which simultaneously achieves near-optimal space and fast update time.",
keywords = "data stream algorithms, frequency moments",
author = "Kane, \{Daniel M.\} and Jelani Nelson and Ely Porat and Woodruff, \{David P.\}",
year = "2011",
doi = "10.1145/1993636.1993735",
language = "الإنجليزيّة",
isbn = "9781450306911",
series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
pages = "745--754",
booktitle = "STOC'11 - Proceedings of the 43rd ACM Symposium on Theory of Computing",
note = "43rd ACM Symposium on Theory of Computing, STOC 2011 ; Conference date: 06-06-2011 Through 08-06-2011",
}