{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:05:10Z","timestamp":1781028310235,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"NSF CAREER award","award":["CCF-2339942"],"award-info":[{"award-number":["CCF-2339942"]}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2335411"],"award-info":[{"award-number":["CCF-2335411"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000142112647"],"award-info":[{"award-number":["N000142112647"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Investigator Award","doi-asserted-by":"publisher","award":["NA"],"award-info":[{"award-number":["NA"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CMU Paul and James Wang Sercomm Presidential Graduate Fellowship award","award":["NA"],"award-info":[{"award-number":["NA"]}]},{"name":"Oak Ridge Associated Universities (ORAU) Ralph E. Powe Junior Faculty Enhancement Award","award":["NA"],"award-info":[{"award-number":["NA"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800929","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"2278-2289","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Adversarial Robustness on Insertion-Deletion Streams"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-2731-6658","authenticated-orcid":false,"given":"Elena","family":"Gribelyuk","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-5162-3328","authenticated-orcid":false,"given":"Honghao","family":"Lin","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2158-1380","authenticated-orcid":false,"given":"David P.","family":"Woodruff","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1450-1896","authenticated-orcid":false,"given":"Huacheng","family":"Yu","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8288-5698","authenticated-orcid":false,"given":"Samson","family":"Zhou","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs. arxiv:2405.17780. arxiv:2405.17780","author":"Ahmadian Sara","year":"2024","unstructured":"Sara Ahmadian and Edith Cohen. 2024. Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs. arxiv:2405.17780. arxiv:2405.17780"},{"key":"e_1_3_2_1_2_1","first-page":"1","article-title":"New Characterizations in Turnstile Streams with Applications. In 31st Conference on Computational Complexity","volume":"20","author":"Ai Yuqing","year":"2016","unstructured":"Yuqing Ai, Wei Hu, Yi Li, and David P. Woodruff. 2016. New Characterizations in Turnstile Streams with Applications. In 31st Conference on Computational Complexity, CCC. 20:1\u201320:22.","journal-title":"CCC."},{"key":"e_1_3_2_1_3_1","volume-title":"International Conference on Management of Data. 15\u201327","author":"Ajtai Mikl\u00f3s","year":"2022","unstructured":"Mikl\u00f3s Ajtai, Vladimir Braverman, T. S. Jayram, Sandeep Silwal, Alec Sun, David P. Woodruff, and Samson Zhou. 2022. The White-Box Adversarial Data Stream Model. In PODS \u201922: International Conference on Management of Data. 15\u201327."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451041"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.82"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3584372.3588681"},{"key":"e_1_3_2_1_8_1","first-page":"1","article-title":"A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators. In 14th Innovations in Theoretical Computer Science Conference","volume":"8","author":"Attias Idan","year":"2023","unstructured":"Idan Attias, Edith Cohen, Moshe Shechner, and Uri Stemmer. 2023. A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators. In 14th Innovations in Theoretical Computer Science Conference, ITCS. 8:1\u20138:19.","journal-title":"ITCS."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330911"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520064"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977066.15"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3498334"},{"key":"e_1_3_2_1_13_1","unstructured":"Omri Ben-Eliezer Sandeep Silwal and Krzysztof Onak. 2025. Robust Streaming Against Low-Memory Adversaries."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3387643"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718171"},{"key":"e_1_3_2_1_16_1","first-page":"1","article-title":"Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","volume":"7","author":"Braverman Vladimir","year":"2018","unstructured":"Vladimir Braverman, Elena Grigorescu, Harry Lang, David P. Woodruff, and Samson Zhou. 2018. Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM. 7:1\u20137:22.","journal-title":"APPROX\/RANDOM."},{"key":"e_1_3_2_1_17_1","volume-title":"Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems, NeurIPS. 3544\u20133557","author":"Braverman Vladimir","year":"2021","unstructured":"Vladimir Braverman, Avinatan Hassidim, Yossi Matias, Mariano Schain, Sandeep Silwal, and Samson Zhou. 2021. Adversarial Robustness of Streaming Algorithms through Importance Sampling. In Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems, NeurIPS. 3544\u20133557."},{"key":"e_1_3_2_1_18_1","volume-title":"APPROX\/RANDOM (LIPIcs","volume":"544","author":"Braverman Vladimir","year":"2014","unstructured":"Vladimir Braverman, Jonathan Katzman, Charles Seidell, and Gregory Vorsanger. 2014. 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 (LIPIcs, Vol. 28). 531\u2013544."},{"key":"e_1_3_2_1_19_1","first-page":"1","article-title":"Revisiting Frequency Moment Estimation in Random Order Streams. In 45th International Colloquium on Automata, Languages, and Programming","volume":"25","author":"Braverman Vladimir","year":"2018","unstructured":"Vladimir Braverman, Emanuele Viola, David P. Woodruff, and Lin F. Yang. 2018. Revisiting Frequency Moment Estimation in Random Order Streams. In 45th International Colloquium on Automata, Languages, and Programming, ICALP. 25:1\u201325:14.","journal-title":"ICALP."},{"key":"e_1_3_2_1_20_1","first-page":"1","article-title":"Adversarially Robust Coloring for Graph Streams. In 13th Innovations in Theoretical Computer Science Conference","volume":"37","author":"Chakrabarti Amit","year":"2022","unstructured":"Amit Chakrabarti, Prantar Ghosh, and Manuel Stoeckl. 2022. Adversarially Robust Coloring for Graph Streams. In 13th Innovations in Theoretical Computer Science Conference, ITCS. 37:1\u201337:23.","journal-title":"ITCS."},{"key":"e_1_3_2_1_21_1","volume-title":"On Adaptive Distance Estimation. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems, NeurIPS.","author":"Cherapanamjeri Yeshwanth","year":"2020","unstructured":"Yeshwanth Cherapanamjeri and Jelani Nelson. 2020. On Adaptive Distance Estimation. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems, NeurIPS."},{"key":"e_1_3_2_1_22_1","volume-title":"The Eleventh International Conference on Learning Representations, ICLR.","author":"Cherapanamjeri Yeshwanth","year":"2023","unstructured":"Yeshwanth Cherapanamjeri, Sandeep Silwal, David P. Woodruff, Fred Zhang, Qiuyi Zhang, and Samson Zhou. 2023. Robust Algorithms on Adaptive Inputs from Bounded Adversaries. In The Eleventh International Conference on Learning Representations, ICLR."},{"key":"e_1_3_2_1_23_1","volume-title":"One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches. CoRR, abs\/2411.06370","author":"Cohen Edith","year":"2024","unstructured":"Edith Cohen, Jelani Nelson, Tam\u00e1s Sarl\u00f3s, Mihir Singhal, and Uri Stemmer. 2024. One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches. CoRR, abs\/2411.06370 (2024)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i6.25882"},{"key":"e_1_3_2_1_25_1","volume-title":"Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries. CoRR, abs\/2502.05723","author":"Cohen Edith","year":"2025","unstructured":"Edith Cohen, Mihir Singhal, and Uri Stemmer. 2025. Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries. CoRR, abs\/2502.05723 (2025)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30620-4_2"},{"key":"e_1_3_2_1_27_1","first-page":"1","article-title":"Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model. In 52nd International Colloquium on Automata, Languages, and Programming","volume":"75","author":"Feng Shiyuan","year":"2025","unstructured":"Shiyuan Feng, William Swartworth, and David P. Woodruff. 2025. Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model. In 52nd International Colloquium on Automata, Languages, and Programming, ICALP. 75:1\u201375:19.","journal-title":"ICALP."},{"key":"e_1_3_2_1_28_1","volume-title":"Polynomial Estimators for High Frequency Moments. CoRR, abs\/1104.4552","author":"Ganguly Sumit","year":"2011","unstructured":"Sumit Ganguly. 2011. Polynomial Estimators for High Frequency Moments. CoRR, abs\/1104.4552 (2011)."},{"key":"e_1_3_2_1_29_1","volume-title":"A Lower Bound for Estimating High Moments of a Data Stream. CoRR, abs\/1201.0253","author":"Ganguly Sumit","year":"2012","unstructured":"Sumit Ganguly. 2012. A Lower Bound for Estimating High Moments of a Data Stream. CoRR, abs\/1201.0253 (2012)."},{"key":"e_1_3_2_1_30_1","first-page":"1","article-title":"High Probability Frequency Moment Sketches. In 45th International Colloquium on Automata, Languages, and Programming","volume":"58","author":"Ganguly Sumit","year":"2018","unstructured":"Sumit Ganguly and David P. Woodruff. 2018. High Probability Frequency Moment Sketches. In 45th International Colloquium on Automata, Languages, and Programming, ICALP (LIPIcs). 58:1\u201358:15.","journal-title":"ICALP (LIPIcs)."},{"key":"e_1_3_2_1_31_1","volume-title":"65th IEEE Annual Symposium on Foundations of Computer Science, FOCS. 2318\u20132343","author":"Gribelyuk Elena","year":"2024","unstructured":"Elena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, and Samson Zhou. 2024. A Strong Separation for Adversarially Robust L_0 Estimation for Linear Sketches. In 65th IEEE Annual Symposium on Foundations of Computer Science, FOCS. 2318\u20132343."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718227"},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing, STOC.","author":"Gribelyuk Elena","year":"2026","unstructured":"Elena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, and Samson Zhou. 2026. Adversarial Robustness on Insertion-Deletion Streams. In Proceedings of the 57th Annual ACM Symposium on Theory of Computing, STOC."},{"key":"e_1_3_2_1_34_1","volume-title":"Symposium on Theory of Computing Conference, STOC. 121\u2013130","author":"Hardt Moritz","unstructured":"Moritz Hardt and David P. Woodruff. 2013. How robust are linear sketches to adaptive inputs? In Symposium on Theory of Computing Conference, STOC. 121\u2013130."},{"key":"e_1_3_2_1_35_1","volume-title":"Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems, NeurIPS.","author":"Hassidim Avinatan","year":"2020","unstructured":"Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, and Uri Stemmer. 2020. Adversarially Robust Streaming Algorithms via Differential Privacy. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems, NeurIPS."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147955"},{"key":"e_1_3_2_1_37_1","volume-title":"Proceedings of the 37th Annual ACM Symposium on Theory of Computing. 202\u2013208","author":"Indyk Piotr","unstructured":"Piotr Indyk and David P. Woodruff. 2005. Optimal approximations of the frequency moments of data streams. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing. 202\u2013208."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3651145"},{"key":"e_1_3_2_1_39_1","volume-title":"The Complexity of Dynamic Least-Squares Regression. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS. 1605\u20131627","author":"Jiang Shunhua","year":"2023","unstructured":"Shunhua Jiang, Binghui Peng, and Omri Weinstein. 2023. The Complexity of Dynamic Least-Squares Regression. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS. 1605\u20131627."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384278"},{"key":"e_1_3_2_1_41_1","volume-title":"Woodruff","author":"Kane Daniel M.","year":"2010","unstructured":"Daniel M. Kane, Jelani Nelson, and David P. Woodruff. 2010. On the Exact Space Complexity of Sketching and Streaming Small Norms. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA. 1161\u20131178."},{"key":"e_1_3_2_1_42_1","volume-title":"Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS. 41\u201352","author":"Kane Daniel M.","unstructured":"Daniel M. Kane, Jelani Nelson, and David P. Woodruff. 2010. An optimal algorithm for the distinct elements problem. In Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS. 41\u201352."},{"key":"e_1_3_2_1_43_1","first-page":"1","article-title":"Linear Sketching over F_2. In 33rd Computational Complexity Conference","volume":"8","author":"Kannan Sampath","year":"2018","unstructured":"Sampath Kannan, Elchanan Mossel, Swagato Sanyal, and Grigory Yaroslavtsev. 2018. Linear Sketching over F_2. In 33rd Computational Complexity Conference, CCC. 8:1\u20138:37.","journal-title":"CCC."},{"key":"e_1_3_2_1_44_1","volume-title":"Proceedings, Part III. 94\u2013121","author":"Kaplan Haim","year":"2021","unstructured":"Haim Kaplan, Yishay Mansour, Kobbi Nissim, and Uri Stemmer. 2021. Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model. In Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO, Proceedings, Part III. 94\u2013121."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/1347082.1347084"},{"key":"e_1_3_2_1_46_1","volume-title":"Symposium on Theory of Computing, STOC. 174\u2013183","author":"Li Yi","unstructured":"Yi Li, Huy L. Nguyen, and David P. Woodruff. 2014. Turnstile streaming algorithms might as well be linear sketches. In Symposium on Theory of Computing, STOC. 174\u2013183."},{"key":"e_1_3_2_1_47_1","first-page":"1","article-title":"Keep That Card in Mind: Card Guessing with Limited Memory. In 13th Innovations in Theoretical Computer Science Conference","volume":"107","author":"Menuhin Boaz","year":"2022","unstructured":"Boaz Menuhin and Moni Naor. 2022. Keep That Card in Mind: Card Guessing with Limited Memory. In 13th Innovations in Theoretical Computer Science Conference, ITCS. 107:1\u2013107:28.","journal-title":"ITCS."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733772"},{"key":"e_1_3_2_1_49_1","first-page":"4557","article-title":"Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach","author":"Mitrovic Slobodan","year":"2017","unstructured":"Slobodan Mitrovic, Ilija Bogunovic, Ashkan Norouzi-Fard, Jakub Tarnawski, and Volkan Cevher. 2017. Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach. In Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems. 4557\u20134566.","journal-title":"Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems."},{"key":"e_1_3_2_1_50_1","volume-title":"Proceedings, Part II. 777\u2013808","author":"Naor Moni","year":"2022","unstructured":"Moni Naor and Noa Oved. 2022. Bet-or-Pass: Adversarially Robust Bloom Filters. In Theory of Cryptography - 20th International Conference, TCC, Proceedings, Part II. 777\u2013808."},{"key":"e_1_3_2_1_51_1","volume-title":"Near Optimal Memory-Regret Tradeoff for Online Learning. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS. 1171\u20131194","author":"Peng Binghui","year":"2023","unstructured":"Binghui Peng and Aviad Rubinstein. 2023. Near Optimal Memory-Regret Tradeoff for Online Learning. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS. 1171\u20131194."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","unstructured":"David P. Woodruff Fred Zhang and Samson Zhou. 2023. On Robust Streaming for Learning with Experts: Algorithms and Lower Bounds. In Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems NeurIPS.","DOI":"10.52202\/075280-3480"},{"key":"e_1_3_2_1_53_1","first-page":"1","article-title":"Separations for Estimating Large Frequency Moments on Data Streams. In 48th International Colloquium on Automata, Languages, and Programming","volume":"112","author":"Woodruff David P.","year":"2021","unstructured":"David P. Woodruff and Samson Zhou. 2021. Separations for Estimating Large Frequency Moments on Data Streams. In 48th International Colloquium on Automata, Languages, and Programming, ICALP. 112:1\u2013112:21.","journal-title":"ICALP."},{"key":"e_1_3_2_1_54_1","volume-title":"62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS. 1183\u20131196","author":"David","unstructured":"David P. Woodruff and Samson Zhou. 2021. Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS. 1183\u20131196."},{"key":"e_1_3_2_1_55_1","volume-title":"Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems, NeurIPS.","author":"David","unstructured":"David P. Woodruff and Samson Zhou. 2024. Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters. In Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems, NeurIPS."},{"key":"e_1_3_2_1_56_1","volume-title":"Workshop.","year":"2025","unstructured":"EnCORE Workshop. 2025. New Horizons for Adaptive Robustness, note=. https:\/\/sites.google.com\/view\/robust-encore"},{"key":"e_1_3_2_1_57_1","unstructured":"FOCS 2023 Workshop. 2023. Exploring the Frontiers of Adaptive Robustness. https:\/\/samsonzhou.github.io\/focs-2023-workshop-adaptive-robustness"},{"key":"e_1_3_2_1_58_1","unstructured":"STOC 2021 Workshop. 2021. Robust Streaming Sketching and Sampling. https:\/\/rajeshjayaram.com\/stoc-2021-robust-streaming-workshop.html"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800929","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800929","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:56:10Z","timestamp":1781027770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":58,"alternative-id":["10.1145\/3798129.3800929","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800929","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}