{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:28:51Z","timestamp":1774333731168,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":11,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_10","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:03Z","timestamp":1770977223000},"page":"140-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Streaming Algorithms for\u00a0Products of\u00a0Probabilities"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4680-7198","authenticated-orcid":false,"given":"Markus","family":"Lohrey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leon","family":"Rische","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3204-3801","authenticated-orcid":false,"given":"Louisa","family":"Seelbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5348-0402","authenticated-orcid":false,"given":"Julio","family":"Xochitemol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Aggarwal, C.C. (ed.): Data Streams - Models and Algorithms, Advances in Database Systems, vol.\u00a031. Springer (2007). https:\/\/doi.org\/10.1007\/978-0-387-47534-9","DOI":"10.1007\/978-0-387-47534-9"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Alur, R., Chen, Y., Jothimurugan, K., Khanna, S.: Space-efficient query evaluation over probabilistic event streams. In: Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2020, pp. 74\u201387. ACM (2020). https:\/\/doi.org\/10.1145\/3373718.3394747","DOI":"10.1145\/3373718.3394747"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Blum, A., Hopcroft, J., Kannan, R.: Foundations of Data Science. Cambridge University Press (2020). https:\/\/doi.org\/10.1017\/9781108755528","DOI":"10.1017\/9781108755528"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Braverman, V., Grigorescu, E., Lang, H., Woodruff, D.P., Zhou, S.: Nearly optimal distinct elements and heavy hitters on sliding windows. In: Proceedings of the 21st International Conference on Approximation Algorithms for Combinatorial Optimization Problems, and the 22nd International Conference on Randomization and Computation, APPROX\/RANDOM 2018. LIPIcs, vol.\u00a0116, pp. 7:1\u20137:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2018.7","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2018.7"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/3-540-45749-6_31","volume-title":"Algorithms \u2014 ESA 2002","author":"M Datar","year":"2002","unstructured":"Datar, M., Muthukrishnan, S.: Estimating rarity and similarity over data stream windows. In: M\u00f6hring, R., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 323\u2013335. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45749-6_31"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press (1997). https:\/\/doi.org\/10.1017\/CBO9780511574948","DOI":"10.1017\/CBO9780511574948"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1006\/JCSS.1998.1577","volume":"57","author":"PB Miltersen","year":"1998","unstructured":"Miltersen, P.B., Nisan, N., Safra, S., Wigderson, A.: On data structures and asymmetric communication complexity. J. Comput. Syst. Sci. 57(1), 37\u201349 (1998). https:\/\/doi.org\/10.1006\/JCSS.1998.1577","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. Found. Trends Theor. Comput. Sci. 1(2) (2005). https:\/\/doi.org\/10.1561\/0400000002","DOI":"10.1561\/0400000002"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Paz, A.: Introduction to Probabilistic Automata (Computer Science and Applied Mathematics). Academic Press, Inc. (1971). https:\/\/doi.org\/10.1016\/C2013-0-11297-4","DOI":"10.1016\/C2013-0-11297-4"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1215\/ijm\/1255631807","volume":"6","author":"JB Rosser","year":"1962","unstructured":"Rosser, J.B., Schoenfeld, L.: Approximate formulas for some functions of prime numbers. Ill. J. Math. 6(1), 64\u201394 (1962). https:\/\/doi.org\/10.1215\/ijm\/1255631807","journal-title":"Ill. J. Math."},{"issue":"3\u20134","key":"10_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1561\/0400000076","volume":"11","author":"T Roughgarden","year":"2016","unstructured":"Roughgarden, T.: Communication complexity (for algorithm designers). Found. Trends Theor. Comput. Sci. 11(3\u20134), 217\u2013404 (2016). https:\/\/doi.org\/10.1561\/0400000076","journal-title":"Found. Trends Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:08:15Z","timestamp":1774325295000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}