{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:19:06Z","timestamp":1763468346030,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,15]],"date-time":"2016-06-15T00:00:00Z","timestamp":1465948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["N660001-1-2-4014"],"award-info":[{"award-number":["N660001-1-2-4014"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1447639"],"award-info":[{"award-number":["1447639"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","award":["Faculty Award"],"award-info":[{"award-number":["Faculty Award"]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,15]]},"DOI":"10.1145\/2902251.2902282","type":"proceedings-article","created":{"date-parts":[[2016,6,16]],"date-time":"2016-06-16T20:16:05Z","timestamp":1466108165000},"page":"261-276","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors"],"prefix":"10.1145","author":[{"given":"Vladimir","family":"Braverman","sequence":"first","affiliation":[{"name":"Johns Hopkins University, Baltimore, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen R.","family":"Chestnut","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David P.","family":"Woodruff","sequence":"additional","affiliation":[{"name":"IBM, San Jose, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin F.","family":"Yang","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237823"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746552"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652164"},{"key":"e_1_3_2_1_5_1","volume-title":"Universal sketches for the frequency negative moments and other decreasing streaming sums. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, page 591","author":"Braverman Vladimir","year":"2015","unstructured":"Vladimir Braverman and Stephen R Chestnut . Universal sketches for the frequency negative moments and other decreasing streaming sums. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, page 591 , 2015 . Vladimir Braverman and Stephen R Chestnut. Universal sketches for the frequency negative moments and other decreasing streaming sums. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, page 591, 2015."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806729"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/978-3-642-40328-6_5","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Braverman Vladimir","year":"2013","unstructured":"Vladimir Braverman and Rafail Ostrovsky . Generalizing the layering method of Indyk and Woodruff: Recursive sketches for frequency-based vectors on streams . In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques , pages 58 -- 70 . Springer , 2013 . Vladimir Braverman and Rafail Ostrovsky. Generalizing the layering method of Indyk and Woodruff: Recursive sketches for frequency-based vectors on streams. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 58--70. Springer, 2013."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214414"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684566"},{"key":"e_1_3_2_1_11_1","first-page":"505","volume-title":"STACS 2009:  26th International Symposium on Theoretical Aspects of Computer Science, volume 3 of LIPIcs. Leibniz Int. Proc. Inform.","author":"Gronemeier Andr\u00e9","year":"2009","unstructured":"Andr\u00e9 Gronemeier . Asymptotically optimal lower bounds on the NIH-multi-party information complexity of the AND-function and disjointness . In STACS 2009: 26th International Symposium on Theoretical Aspects of Computer Science, volume 3 of LIPIcs. Leibniz Int. Proc. Inform. , pages 505 -- 516 . Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern , 2009 . Andr\u00e9 Gronemeier. Asymptotically optimal lower bounds on the NIH-multi-party information complexity of the AND-function and disjointness. In STACS 2009: 26th International Symposium on Theoretical Aspects of Computer Science, volume 3 of LIPIcs. Leibniz Int. Proc. Inform., pages 505--516. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2009."},{"key":"e_1_3_2_1_12_1","unstructured":"Sudipto Guha and Piotr Indyk. Problem 5: Characterizing Sketchable Distances. http:\/\/sublinear.info\/5 2006.  Sudipto Guha and Piotr Indyk. Problem 5: Characterizing Sketchable Distances. http:\/\/sublinear.info\/5 2006."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1768841.1768881"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796606"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060621"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/1978665.1978670"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_42"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000370050018"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2094114.2094118"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591812"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40328-6_43"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2038916.2038928"}],"event":{"name":"SIGMOD\/PODS'16: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"San Francisco California USA","acronym":"SIGMOD\/PODS'16"},"container-title":["Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2902251.2902282","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2902251.2902282","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2902251.2902282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:59Z","timestamp":1750222499000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2902251.2902282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,15]]},"references-count":20,"alternative-id":["10.1145\/2902251.2902282","10.1145\/2902251"],"URL":"https:\/\/doi.org\/10.1145\/2902251.2902282","relation":{},"subject":[],"published":{"date-parts":[[2016,6,15]]},"assertion":[{"value":"2016-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}