{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:18:13Z","timestamp":1763468293236,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF 0832797"],"award-info":[{"award-number":["CCF 0832797"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Siebel Scholarship"},{"DOI":"10.13039\/100004316","name":"International Business Machines Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004316","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591812","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"174-183","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Turnstile streaming algorithms might as well be linear sketches"],"prefix":"10.1145","author":[{"given":"Yi","family":"Li","sequence":"first","affiliation":[{"name":"Max-Planck Institute for Informatics"}]},{"given":"Huy L.","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Princeton University"}]},{"given":"David P.","family":"Woodruff","sequence":"additional","affiliation":[{"name":"IBM Research, Almaden"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"e_1_3_2_2_2_1","unstructured":"A. Andoni. High frequency moment via max stability. Available at http:\/\/web.mit.edu\/andoni\/www\/papers\/fkStable.pdf.  A. Andoni. High frequency moment via max stability. Available at http:\/\/web.mit.edu\/andoni\/www\/papers\/fkStable.pdf."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.82"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39206-1_3"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1123797"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/872747.873185"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.4171\/052"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250891"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109634"},{"key":"e_1_3_2_2_11_1","unstructured":"V. Braverman and R. Ostrovsky. Recursive sketching for frequency moments. CoRR abs\/1011.2571 2010.  V. Braverman and R. Ostrovsky. Recursive sketching for frequency moments. CoRR abs\/1011.2571 2010."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_15"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214414"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684566"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536445"},{"key":"e_1_3_2_2_16_1","first-page":"151","volume-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Coppersmith D.","year":"2004"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1824777.1824786"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.46"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27821-4_33"},{"key":"e_1_3_2_2_21_1","unstructured":"S. Ganguly. A hybrid algorithm for estimating frequency moments of data streams 2004. Manuscript.  S. Ganguly. A hybrid algorithm for estimating frequency moments of data streams 2004. Manuscript."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1813695.1813720"},{"key":"e_1_3_2_2_23_1","first-page":"163","volume-title":"Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory -","volume":"94","author":"Ganguly S.","year":"2009"},{"key":"e_1_3_2_2_24_1","unstructured":"S. Ganguly. Polynomial estimators for high frequency moments. CoRR abs\/1104.4552 2011.  S. Ganguly. Polynomial estimators for high frequency moments. CoRR abs\/1104.4552 2011."},{"key":"e_1_3_2_2_25_1","unstructured":"S. Ganguly. A lower bound for estimating high moments of a data stream. CoRR abs\/1201.0253 2012.  S. Ganguly. A lower bound for estimating high moments of a data stream. CoRR abs\/1201.0253 2012."},{"key":"e_1_3_2_2_26_1","first-page":"505","volume-title":"STACS","author":"Gronemeier A.","year":"2009"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488624"},{"key":"e_1_3_2_2_28_1","unstructured":"P. Indyk. Sketching streaming and sublinear-space algorithms 2007. Graduate course notes available at http:\/\/stellar.mit.edu\/S\/course\/6\/fa07\/6.895\/.  P. Indyk. Sketching streaming and sublinear-space algorithms 2007. Graduate course notes available at http:\/\/stellar.mit.edu\/S\/course\/6\/fa07\/6.895\/."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060621"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_42"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000370050018"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634188"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873693"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000002"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90157-D"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627864"},{"volume-title":"Eidgen\u00f6ssische Technische Hochschule Z\u00fcrich","year":"2000","author":"Storjohann A.","key":"e_1_3_2_2_37_1"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1978-0500555-0"},{"key":"e_1_3_2_2_39_1","first-page":"167","volume-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Woodruff D. P.","year":"2004"}],"event":{"name":"STOC '14: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York","acronym":"STOC '14"},"container-title":["Proceedings of the forty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591812","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591812","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:45Z","timestamp":1750229745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591812"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":39,"alternative-id":["10.1145\/2591796.2591812","10.1145\/2591796"],"URL":"https:\/\/doi.org\/10.1145\/2591796.2591812","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}