Published in: LIPIcs, Volume 60, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)
Vladimir Braverman, Alan Roytman, and Gregory Vorsanger. Approximating Subadditive Hadamard Functions on Implicit Matrices. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 60, pp. 25:1-25:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{braverman_et_al:LIPIcs.APPROX-RANDOM.2016.25, author = {Braverman, Vladimir and Roytman, Alan and Vorsanger, Gregory}, title = {{Approximating Subadditive Hadamard Functions on Implicit Matrices}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)}, pages = {25:1--25:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-018-7}, ISSN = {1868-8969}, year = {2016}, volume = {60}, editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.25}, URN = {urn:nbn:de:0030-drops-66483}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.25}, annote = {Keywords: Streaming Algorithms, Measuring Independence, Hadamard Functions, Implicit Matrices} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Vladimir Braverman, Jonathan Katzman, Charles Seidell, and Gregory Vorsanger. An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 531-544, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@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.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} }
Feedback for Dagstuhl Publishing