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

researchr

You are not signed in
Sign in
Sign up

Vladimir Braverman, Jonathan Katzman, Charles Seidell, Gregory Vorsanger. An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits. In Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, Cristopher Moore, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain. Volume 28 of LIPIcs, pages 531-544, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014. [doi]

This author has not been identified. Look up 'Vladimir Braverman' in GoogleThis author has not been identified. Look up 'Jonathan Katzman' in GoogleThis author has not been identified. Look up 'Charles Seidell' in GoogleThis author has not been identified. Look up 'Gregory Vorsanger' in Google

runs on WebDSL