{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:17Z","timestamp":1759638017074,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T00:00:00Z","timestamp":1592092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Len Blavatnik and the Blavatnik Foundation and The Blavatnik Interdisciplinary Cyber Research Center at Tel Aviv University"},{"name":"NSF","award":["CCF-1815840"],"award-info":[{"award-number":["CCF-1815840"]}]},{"name":"ISF","award":["484\/18 and 1789\/19"],"award-info":[{"award-number":["484\/18 and 1789\/19"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,14]]},"DOI":"10.1145\/3375395.3387658","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T15:10:29Z","timestamp":1590765029000},"page":"63-80","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["A Framework for Adversarially Robust Streaming Algorithms"],"prefix":"10.1145","author":[{"given":"Omri","family":"Ben-Eliezer","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]},{"given":"Rajesh","family":"Jayaram","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"David P.","family":"Woodruff","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Eylon","family":"Yogev","sequence":"additional","affiliation":[{"name":"Boston University and Tel Aviv University, Boston & Tel Aviv, Israel"}]}],"member":"320","published-online":{"date-parts":[[2020,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095156"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213560"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"volume-title":"Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","author":"Ben-Eliezer O.","key":"e_1_3_2_1_5_1","unstructured":"Ben-Eliezer , O. , and Yogev , E . The adversarial robustness of sampling . Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems , to appear (2020). Ben-Eliezer, O., and Yogev, E. The adversarial robustness of sampling. Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, to appear (2020)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175461"},{"key":"e_1_3_2_1_7_1","first-page":"1","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"B\u0142asiok J.","year":"2017","unstructured":"B\u0142asiok , J. , Ding , J. , and Nelson , J . Continuous monitoring of $l_p$ norms in data streams . In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques ( 2017 ), APPROX\/RANDOM , pp. 32: 1 -- 32 :13. B\u0142asiok, J., Ding, J., and Nelson, J. Continuous monitoring of $l_p$ norms in data streams. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2017), APPROX\/RANDOM, pp. 32:1--32:13."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3034798"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.14"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00400-6"},{"key":"e_1_3_2_1_11_1","first-page":"196","volume-title":"Artificial Intelligence and Statistics","author":"Clifford P.","year":"2013","unstructured":"Clifford , P. , and Cosma , I . A simple sketching algorithm for entropy estimation over streaming data . In Artificial Intelligence and Statistics ( 2013 ), pp. 196 -- 206 . Clifford, P., and Cosma, I. A simple sketching algorithm for entropy estimation over streaming data. In Artificial Intelligence and Statistics (2013), pp. 196--206."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645918.672512"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02026-1_28"},{"key":"e_1_3_2_1_14_1","first-page":"1","volume-title":"45th International Colloquium on Automata, Languages, and Programming","author":"Ganguly S.","year":"2018","unstructured":"Ganguly , S. , and Woodruff , D. P . High probability frequency moment sketches. In 45th International Colloquium on Automata, Languages, and Programming ( 2018 ), ICALP, pp. 58: 1 -- 58 :15. Ganguly, S., and Woodruff, D. P. High probability frequency moment sketches. In 45th International Colloquium on Automata, Languages, and Programming (2018), ICALP, pp. 58:1--58:15."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2012.6181772"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2012.6319752"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000001"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/00949658908811160"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.4064\/sm-70-3-231-283"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488624"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.76"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196986"},{"key":"e_1_3_2_1_23_1","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Jayaram R.","year":"2019","unstructured":"Jayaram , R. , and Woodruff , D. P . Towards optimal moment estimation in streaming and distributed models . In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques ( 2019 ), APPROX\/RANDOM. Jayaram, R., and Woodruff, D. P. Towards optimal moment estimation in streaming and distributed models. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2019), APPROX\/RANDOM."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.82"},{"key":"e_1_3_2_1_25_1","volume-title":"Optimal bounds for johnson-lindenstrauss transforms and streaming problems with subconstant error. ACM Transactions on Algorithms (TALG) 9, 3","author":"Jayram T. S.","year":"2013","unstructured":"Jayram , T. S. , and Woodruff , D. P . Optimal bounds for johnson-lindenstrauss transforms and streaming problems with subconstant error. ACM Transactions on Algorithms (TALG) 9, 3 ( 2013 ), 26. Jayram, T. S., and Woodruff, D. P. Optimal bounds for johnson-lindenstrauss transforms and streaming problems with subconstant error. ACM Transactions on Algorithms (TALG) 9, 3 (2013), 26."},{"key":"e_1_3_2_1_26_1","volume-title":"New bounds for L2 heavy hitters in insertion-only streams","author":"Kamath A.","year":"2019","unstructured":"Kamath , A. , Price , E. , and Woodruff , D. P . New bounds for L2 heavy hitters in insertion-only streams , 2019 . Kamath, A., Price, E., and Woodruff, D. P. New bounds for L2 heavy hitters in insertion-only streams, 2019."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873694"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807094"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40328-6_43"},{"key":"e_1_3_2_1_30_1","first-page":"49","volume-title":"Proceedings of Symposia in Applied Mathematics","volume":"42","author":"McCurley K. S.","year":"1990","unstructured":"McCurley , K. S. The discrete logarithm problem . In Proceedings of Symposia in Applied Mathematics ( 1990 ), vol. 42 , pp. 49 -- 74 . McCurley, K. S. The discrete logarithm problem. In Proceedings of Symposia in Applied Mathematics (1990), vol. 42, pp. 49--74."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733772"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/867576"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000002"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_28"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019223872X"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/982792.982817"}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Portland OR USA","acronym":"SIGMOD\/PODS '20"},"container-title":["Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375395.3387658","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3375395.3387658","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:48Z","timestamp":1750199568000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375395.3387658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,14]]},"references-count":37,"alternative-id":["10.1145\/3375395.3387658","10.1145\/3375395"],"URL":"https:\/\/doi.org\/10.1145\/3375395.3387658","relation":{},"subject":[],"published":{"date-parts":[[2020,6,14]]},"assertion":[{"value":"2020-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}