{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:04:46Z","timestamp":1743105886535,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030866914"},{"type":"electronic","value":"9783030866921"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86692-1_15","type":"book-chapter","created":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T21:24:41Z","timestamp":1632777881000},"page":"179-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Lower Bounds for the Number of\u00a0Repetitions in 2D Strings"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Gawrychowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samah","family":"Ghazawi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,27]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Amir, A., Benson, G.: Efficient two-dimensional compressed matching. In: Data Compression Conference, pp. 279\u2013288 (1992)","DOI":"10.1109\/DCC.1992.227453"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/S0097539795298321","volume":"27","author":"A Amir","year":"1998","unstructured":"Amir, A., Benson, G.: Two-dimensional periodicity in rectangular arrays. SIAM J. Comput. 27(1), 90\u2013106 (1998)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/S0097539792226321","volume":"23","author":"A Amir","year":"1995","unstructured":"Amir, A., Benson, G., Farach-Colton, M.: An alphabet independent approach to two dimensional pattern matching. SIAM J. Comput. 23(2), 313\u2013323 (1995)","journal-title":"SIAM J. Comput."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2705","volume":"144","author":"A Amir","year":"1998","unstructured":"Amir, A., Benson, G., Farach-Colton, M.: Optimal parallel two dimensional text searching on a CREW PRAM. Inf. Comput. 144, 1\u201317 (1998)","journal-title":"Inf. Comput."},{"key":"15_CR5","unstructured":"Amir, A., Landau, G.M., Marcus, S., Sokol, D.: Two-dimensional maximal repetitions. In: 26th ESA, vol. 112, no. 2, pp. 1\u201314 (2018)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2019.07.006","volume":"812","author":"A Amir","year":"2020","unstructured":"Amir, A., Landau, G.M., Marcus, S., Sokol, D.: Two-dimensional maximal repetitions. Theoret. Comput. Sci. 812, 49\u201361 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-319-67428-5_3","volume-title":"String Processing and Information Retrieval","author":"M Amit","year":"2017","unstructured":"Amit, M., Gawrychowski, P.: Distinct squares in circular words. In: Fici, G., Sciortino, M., Venturini, R. (eds.) SPIRE 2017. LNCS, vol. 10508, pp. 27\u201337. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67428-5_3"},{"issue":"1\u20132","key":"15_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0304-3975(98)00182-0","volume":"237","author":"A Apostolico","year":"2000","unstructured":"Apostolico, A., Brimkov, V.: Fibonacci arrays and their two-dimensional repetitions. Theoret. Comput. Sci. 237(1\u20132), 263\u2013273 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"15_CR9","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/15M1011032","volume":"46","author":"HIT Bannai","year":"2017","unstructured":"Bannai, H.I.T., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: The \u201cruns\" theorem. SIAM J. Comput. 46(5), 1501\u20131514 (2017)","journal-title":"SIAM J. Comput."},{"key":"15_CR10","unstructured":"Charalampopoulos, P., Radoszewski, J., Rytter, W., Wale\u0144, T., Zuba, W.: The number of repetitions in 2D-strings. In: 28th ESA, vol. 173, no. 32, pp. 1\u201318 (2020)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Cole, R., et al.: Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions. In: 34th FOCS, pp. 248\u2013258 (1993)","DOI":"10.1109\/SFCS.1993.366862"},{"issue":"5","key":"15_CR12","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1016\/j.jcss.2007.09.003","volume":"74","author":"M Crochemore","year":"2008","unstructured":"Crochemore, M., Ilie, L.: Maximal repetitions in strings. J. Comput. Syst. Sci. 74(5), 796\u2013807 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"27","key":"15_CR13","doi-asserted-by":"publisher","first-page":"2931","DOI":"10.1016\/j.tcs.2010.06.019","volume":"412","author":"M Crochemore","year":"2011","unstructured":"Crochemore, M., Ilie, L., Tinta, L.: The \u201cruns\u2019\u2019 conjecture. Theoret. Comput. Sci. 412(27), 2931\u20132941 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-31265-6_3","volume-title":"Combinatorial Pattern Matching","author":"M Crochemore","year":"2012","unstructured":"Crochemore, M., et al.: The maximum number of squares in a tree. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 27\u201340. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31265-6_3"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2013.11.018","volume":"521","author":"M Crochemore","year":"2014","unstructured":"Crochemore, M., Iliopoulos, C.S., Kubica, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: Extracting powers and periods in a word from its runs structure. Theoret. Comput. Sci. 521, 29\u201341 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01190846","volume":"13","author":"M Crochemore","year":"1995","unstructured":"Crochemore, M., Rytter, W.: Squares, cubes, and time-space efficient string searching. Algorithmica 13, 405\u2013425 (1995). https:\/\/doi.org\/10.1007\/BF01190846","journal-title":"Algorithmica"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/3-540-45005-X_28","volume-title":"Developments in Language Theory","author":"JD Currie","year":"2003","unstructured":"Currie, J.D., Fitzpatrick, D.S.: Circular words avoiding patterns. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 319\u2013325. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45005-X_28"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.dam.2014.08.016","volume":"180","author":"A Deza","year":"2015","unstructured":"Deza, A., Franek, F., Thierry, A.: How many double squares can a string contain? Discret. Appl. Math. 180, 52\u201369 (2015)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"15_CR19","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0304-3975(99)00320-5","volume":"255","author":"X Droubay","year":"2001","unstructured":"Droubay, X., Justin, J., Pirillo, G.: Episturmian words and some constructions of de Luca and Rauzy. Theoret. Comput. Sci. 255(1), 539\u2013553 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-319-23826-5_27","volume-title":"String Processing and Information Retrieval","author":"J Fischer","year":"2015","unstructured":"Fischer, J., Holub, \u0160, I, T., Lewenstein, M.: Beyond the runs theorem. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 277\u2013286. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23826-5_27"},{"issue":"1","key":"15_CR21","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcta.1997.2843","volume":"82","author":"AS Fraenkel","year":"1998","unstructured":"Fraenkel, A.S., Simpson, J.: How many squares can a string contain? J. Comb. Theory, Ser. A 82(1), 112\u2013120 (1998)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1142\/S0129054108005620","volume":"19","author":"F Franek","year":"2008","unstructured":"Franek, F., Yang, Q.: An asymptotic lower bound for the maximal number of runs in a string. Int. J. Found. Comput. Sci. 19(1), 195\u2013203 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-319-23826-5_26","volume-title":"String Processing and Information Retrieval","author":"P Gawrychowski","year":"2015","unstructured":"Gawrychowski, P., Kociumaka, T., Rytter, W., Wale\u0144, T.: Tight bound for the number of distinct palindromes in a tree. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 270\u2013276. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23826-5_26"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-540-88282-4_22","volume-title":"Language and Automata Theory and Applications","author":"M Giraud","year":"2008","unstructured":"Giraud, M.: Not so many runs in strings. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 232\u2013239. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88282-4_22"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2017.01.026","volume":"684","author":"S Holub","year":"2017","unstructured":"Holub, S.: Prefix frequency of lost positions. Theoret. Comput. Sci. 684, 43\u201352 (2017)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"15_CR26","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.jcta.2005.01.006","volume":"112","author":"L Ilie","year":"2005","unstructured":"Ilie, L.: A simple proof that a word of length n has at most 2n distinct squares. J. Comb. Theory, Ser. A 112(1), 163\u2013164 (2005)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"3","key":"15_CR27","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.tcs.2007.03.025","volume":"380","author":"L Ilie","year":"2007","unstructured":"Ilie, L.: A note on the number of squares in a word. Theoret. Comput. Sci. 380(3), 373\u2013376 (2007)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"15_CR28","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1007\/s00453-016-0271-3","volume":"79","author":"T Kociumaka","year":"2017","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Walen, T.: String powers in trees. Algorithmica 79(3), 814\u2013834 (2017). https:\/\/doi.org\/10.1007\/s00453-016-0271-3","journal-title":"Algorithmica"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: 40th FOCS, pp. 596\u2013604. IEEE Computer Society (1999)","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"15_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-319-23660-5_14","volume-title":"Combinatorics on Words","author":"F Manea","year":"2015","unstructured":"Manea, F., Seki, S.: Square-density increasing mappings. In: Manea, F., Nowotka, D. (eds.) WORDS 2015. LNCS, vol. 9304, pp. 160\u2013169. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23660-5_14"},{"key":"15_CR31","unstructured":"Matsubara, W., Kusano, K., Ishino, A., Bannai, H., Shinohara, A.: New lower bounds for the maximum number of runs in a string. In: Proceedings of the Prague Stringology Conference 2008, pp. 140\u2013145 (2008)"},{"issue":"1\u20133","key":"15_CR32","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.tcs.2008.04.020","volume":"401","author":"SJ Puglisi","year":"2008","unstructured":"Puglisi, S.J., Simpson, J., Smyth, W.F.: How many runs can a string contain? Theoret. Comput. Sci. 401(1\u20133), 165\u2013171 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"9","key":"15_CR33","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1016\/j.ic.2007.01.007","volume":"205","author":"W Rytter","year":"2007","unstructured":"Rytter, W.: The number of runs in a string. Inf. Comput. 205(9), 1459\u20131469 (2007)","journal-title":"Inf. Comput."},{"key":"15_CR34","first-page":"129","volume":"46","author":"J Simpson","year":"2010","unstructured":"Simpson, J.: Modified Padovan words and the maximum number of runs in a word. Australas. J. Combin. 46, 129\u2013146 (2010)","journal-title":"Australas. J. Combin."},{"key":"15_CR35","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2014.07.012","volume":"550","author":"J Simpson","year":"2014","unstructured":"Simpson, J.: Palindromes in circular words. Theoret. Comput. Sci. 550, 66\u201378 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR36","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske Vid Selsk. Skr. I Mat-Nat Kl. (Christiana) 7, 1\u201322 (1906)"}],"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-030-86692-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:35:20Z","timestamp":1725831320000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86692-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030866914","9783030866921"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86692-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 September 2021","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":"Lille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cristal.univ-lille.fr\/spire2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.87","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.32","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 invited papers are also included. The symposium was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}