{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T18:26:24Z","timestamp":1787682384998,"version":"build-2784847793"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032052278","type":"print"},{"value":"9783032052285","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"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-3-032-05228-5_13","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:01:26Z","timestamp":1758474086000},"page":"148-155","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two-Player Communication Complexity of\u00a0Pattern Matching"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6993-5440","authenticated-orcid":false,"given":"Pawe\u0142","family":"Gawrychowski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9540-0522","authenticated-orcid":false,"given":"Wojciech","family":"Janczewski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,9,22]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N Alon","year":"1999","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58(1), 137\u2013147 (1999)","journal-title":"J. Comput. Syst. Sci."},{"issue":"10","key":"13_CR2","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"RS Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. ACM 20(10), 762\u2013772 (1977)","journal-title":"Commun. ACM"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Breslauer, D., Galil, Z.: Real-time streaming string-matching. ACM Trans. Algorithms 10(4), 22:1\u201322:12 (2014)","DOI":"10.1145\/2635814"},{"issue":"5","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1137\/120861072","volume":"41","author":"A Chakrabarti","year":"2012","unstructured":"Chakrabarti, A., Regev, O.: An optimal lower bound on the communication complexity of gap-hamming-distance. SIAM J. Comput. 41(5), 1299\u20131317 (2012)","journal-title":"SIAM J. Comput."},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Clifford, R., Fontaine, A., Porat, E., Sach, B., Starikovskaya, T.: Dictionary matching in a stream. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 361\u2013372. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_31","DOI":"10.1007\/978-3-662-48350-3_31"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-31265-6_8","volume-title":"Combinatorial Pattern Matching","author":"R Clifford","year":"2012","unstructured":"Clifford, R., Jalsenius, M., Porat, E., Sach, B.: Pattern matching in multiple streams. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 97\u2013109. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31265-6_8"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Clifford, R., Kociumaka, T., Porat, E.: The streaming k-mismatch problem. In: SODA. pp. 1106\u20131125. SIAM (2019)","DOI":"10.1137\/1.9781611975482.68"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Ergun, F., Jowhari, H., Sa\u011flam, M.: Periodicity in Streams. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX\/RANDOM -2010. LNCS, vol. 6302, pp. 545\u2013559. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15369-3_41","DOI":"10.1007\/978-3-642-15369-3_41"},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1007\/s00453-021-00876-x","volume":"84","author":"P Gawrychowski","year":"2022","unstructured":"Gawrychowski, P., Starikovskaya, T.: Streaming dictionary matching with mismatches. Algorithmica 84(4), 896\u2013916 (2022)","journal-title":"Algorithmica"},{"key":"13_CR10","unstructured":"Golan, S., Kopelowitz, T., Porat, E.: Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams. In: ICALP. LIPIcs, vol.\u00a0107, pp. 65:1\u201365:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"issue":"5","key":"13_CR11","doi-asserted-by":"publisher","first-page":"1988","DOI":"10.1007\/s00453-018-0521-7","volume":"81","author":"S Golan","year":"2019","unstructured":"Golan, S., Kopelowitz, T., Porat, E.: Streaming pattern matching with d wildcards. Algorithmica 81(5), 1988\u20132015 (2019)","journal-title":"Algorithmica"},{"key":"13_CR12","unstructured":"Golan, S., Porat, E.: Real-time streaming multi-pattern search for constant alphabet. In: ESA. LIPIcs, vol.\u00a087, pp. 41:1\u201341:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"RM Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249\u2013260 (1987)","journal-title":"IBM J. Res. Dev."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Knuth, D.E., Jr., J.H.M., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977)","DOI":"10.1137\/0206024"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574948"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Porat, B., Porat, E.: Exact and approximate pattern matching in the streaming model. In: FOCS, pp. 315\u2013323. IEEE Computer Society (2009)","DOI":"10.1109\/FOCS.2009.11"},{"key":"13_CR17","unstructured":"Starikovskaya, T.: Communication and streaming complexity of approximate pattern matching. In: CPM. LIPIcs, vol.\u00a078, pp. 13:1\u201313:11. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"13_CR18","unstructured":"Woodruff, D.P.: Optimal space lower bounds for all frequency moments. In: SODA. pp. 167\u2013175. SIAM (2004)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-05228-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T18:04:28Z","timestamp":1787681068000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05228-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,22]]},"ISBN":["9783032052278","9783032052285"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05228-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,22]]},"assertion":[{"value":"22 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/spire-2025\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}