{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:56Z","timestamp":1750220936834,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,25]]},"DOI":"10.1145\/3294052.3319701","type":"proceedings-article","created":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T12:56:45Z","timestamp":1560776205000},"page":"254-268","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives"],"prefix":"10.1145","author":[{"given":"Michele","family":"Borassi","sequence":"first","affiliation":[{"name":"Google Research, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Epasto","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvio","family":"Lattanzi","sequence":"additional","affiliation":[{"name":"Google Research, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergei","family":"Vassilvitskii","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morteza","family":"Zadimoghaddam","sequence":"additional","affiliation":[{"name":"Google Research, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213560"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237823"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055598"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/545381.545465"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773176"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Ashwinkumar Badanidiyuru Baharan Mirzasoleiman Amin Karbasi and Andreas Krause. 2014. Streaming submodular maximization: Massive data summarization on the fly. In ACM SIGKDD. ACM 671--680.  Ashwinkumar Badanidiyuru Baharan Mirzasoleiman Amin Karbasi and Andreas Krause. 2014. Streaming submodular maximization: Massive data summarization on the fly. In ACM SIGKDD. ACM 671--680.","DOI":"10.1145\/2623330.2623637"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/646978.711822"},{"key":"e_1_3_2_1_8_1","volume-title":"Efficient summing over sliding windows. arXiv preprint arXiv:1604.02450","author":"Basat Ran Ben","year":"2016","unstructured":"Ran Ben Basat , Gil Einziger , Roy Friedman , and Yaron Kassner . 2016. Efficient summing over sliding windows. arXiv preprint arXiv:1604.02450 ( 2016 ). Ran Ben Basat, Gil Einziger, Roy Friedman, and Yaron Kassner. 2016. Efficient summing over sliding windows. arXiv preprint arXiv:1604.02450 (2016)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.39"},{"key":"e_1_3_2_1_10_1","volume-title":"Numerical Linear Algebra in the Sliding Window Model. arXiv preprint arXiv:1805.03765","author":"Braverman Vladimir","year":"2018","unstructured":"Vladimir Braverman , Petros Drineas , Jalaj Upadhyay , and Samson Zhou . 2018a. Numerical Linear Algebra in the Sliding Window Model. arXiv preprint arXiv:1805.03765 ( 2018 ). Vladimir Braverman, Petros Drineas, Jalaj Upadhyay, and Samson Zhou. 2018a. Numerical Linear Algebra in the Sliding Window Model. arXiv preprint arXiv:1805.03765 (2018)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.06.008"},{"key":"e_1_3_2_1_12_1","volume-title":"Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. arXiv preprint arXiv:1805.00212","author":"Braverman Vladimir","year":"2018","unstructured":"Vladimir Braverman , Elena Grigorescu , Harry Lang , David P Woodruff , and Samson Zhou . 2018b. Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. arXiv preprint arXiv:1805.00212 ( 2018 ). Vladimir Braverman, Elena Grigorescu, Harry Lang, David P Woodruff, and Samson Zhou. 2018b. Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. arXiv preprint arXiv:1805.00212 (2018)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884530"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884530"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.63"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559818"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055540.3055541"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9506-5"},{"volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Chekuri Chandra","key":"e_1_3_2_1_19_1","unstructured":"Chandra Chekuri , Shalmoli Gupta , and Kent Quanrud . 2015. Streaming algorithms for submodular function maximization . In International Colloquium on Automata, Languages, and Programming . Springer , 318--330. Chandra Chekuri, Shalmoli Gupta, and Kent Quanrud. 2015. Streaming algorithms for submodular function maximization. In International Colloquium on Automata, Languages, and Programming. Springer, 318--330."},{"key":"e_1_3_2_1_20_1","volume-title":"Submodular Maximization over Sliding Windows. CoRR","author":"Chen Jiecao","year":"2016","unstructured":"Jiecao Chen , Huy L. Nguyen , and Qin Zhang . 2016. Submodular Maximization over Sliding Windows. CoRR , Vol. abs\/ 1611 .00129 ( 2016 ). arxiv: 1611.00129 http:\/\/arxiv.org\/abs\/1611.00129 Jiecao Chen, Huy L. Nguyen, and Qin Zhang. 2016. Submodular Maximization over Sliding Windows. CoRR, Vol. abs\/1611.00129 (2016). arxiv: 1611.00129 http:\/\/arxiv.org\/abs\/1611.00129"},{"volume-title":"43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) (Leibniz International Proceedings in Informatics (LIPIcs))","author":"Cohen-Addad Vincent","key":"e_1_3_2_1_21_1","unstructured":"Vincent Cohen-Addad , Chris Schwiegelshohn , and Christian Sohler . 2016. Diameter and k-Center in Sliding Windows . In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) (Leibniz International Proceedings in Informatics (LIPIcs)) , Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi (Eds.), Vol. 55 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany , 19:1--19:12. Vincent Cohen-Addad, Chris Schwiegelshohn, and Christian Sohler. 2016. Diameter and k-Center in Sliding Windows. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) (Leibniz International Proceedings in Informatics (LIPIcs)), Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi (Eds.), Vol. 55. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 19:1--19:12."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40450-4_29"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398363"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052699"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564880"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12530-010-9020-z"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792918.1792978"},{"key":"e_1_3_2_1_29_1","volume-title":"streaming and sublinear-space algorithms. Graduate course notes, available at","author":"Indyk Piotr","year":"2007","unstructured":"Piotr Indyk . 2007. Sketching , streaming and sublinear-space algorithms. Graduate course notes, available at ( 2007 ). Piotr Indyk. 2007. Sketching, streaming and sublinear-space algorithms. Graduate course notes, available at (2007)."},{"volume-title":"Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS '14)","author":"Indyk Piotr","key":"e_1_3_2_1_30_1","unstructured":"Piotr Indyk , Sepideh Mahabadi , Mohammad Mahdian , and Vahab S. Mirrokni . 2014. Composable Core-sets for Diversity and Coverage Maximization . In Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS '14) . ACM, New York, NY, USA, 100--108. Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, and Vahab S. Mirrokni. 2014. Composable Core-sets for Diversity and Coverage Maximization. In Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS '14). ACM, New York, NY, USA, 100--108."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109636"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142393"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_15"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000002"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509963"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.3390\/a4030200"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067429"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497564"}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19"},"container-title":["Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3294052.3319701","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3294052.3319701","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:28Z","timestamp":1750204408000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3294052.3319701"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":38,"alternative-id":["10.1145\/3294052.3319701","10.1145\/3294052"],"URL":"https:\/\/doi.org\/10.1145\/3294052.3319701","relation":{},"subject":[],"published":{"date-parts":[[2019,6,25]]},"assertion":[{"value":"2019-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}