{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:43Z","timestamp":1760202703459,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319199283"},{"type":"electronic","value":"9783319199290"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-19929-0_25","type":"book-chapter","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T13:09:49Z","timestamp":1434373789000},"page":"295-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Online Detection of Repetitions with Backtracking"],"prefix":"10.1007","author":[{"given":"Dmitry","family":"Kosolobov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"issue":"6","key":"25_CR1","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1137\/S0097539793260404","volume":"25","author":"A Apostolico","year":"1996","unstructured":"Apostolico, A., Breslauer, D.: An optimal $$O(\\log \\log n)$$-time parallel algorithm for detecting all squares in a string. SIAM J. Comput. 25(6), 1318\u20131331 (1996)","journal-title":"SIAM J. Comput."},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-21458-5_16","volume-title":"Combinatorial Pattern Matching","author":"D Breslauer","year":"2011","unstructured":"Breslauer, D., Grossi, R., Mignosi, F.: Simple real-time constant-space string matching. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 173\u2013183. Springer, Heidelberg (2011)"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.jda.2012.07.003","volume":"18","author":"D Breslauer","year":"2013","unstructured":"Breslauer, D., Italiano, G.F.: Near real-time suffix tree construction via the fringe marked ancestor problem. J. Discrete Algorithms 18, 32\u201348 (2013)","journal-title":"J. Discrete Algorithms"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","volume":"45","author":"M Crochemore","year":"1986","unstructured":"Crochemore, M.: Transducers and repetitions. Theor. Comput. Sci. 45, 63\u201386 (1986)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"25_CR5","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0022-0000(83)90002-8","volume":"26","author":"Z Galil","year":"1983","unstructured":"Galil, Z., Seiferas, J.: Time-space-optimal string matching. J. Comput. Syst. Sci. 26(3), 280\u2013294 (1983)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1016\/j.tcs.2008.08.038","volume":"407","author":"JJ Hong","year":"2008","unstructured":"Hong, J.J., Chen, G.H.: Efficient on-line repetition detection. Theor. Comput. Sci. 407(1), 554\u2013563 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/11549345_45","volume-title":"Mathematical Foundations of Computer Science 2005","author":"J Jansson","year":"2005","unstructured":"Jansson, J., Peng, Z.: Online and dynamic recognition of squarefree strings. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 520\u2013531. Springer, Heidelberg (2005)"},{"key":"25_CR8","unstructured":"Kosolobov, D.: Lempel-Ziv factorization may be harder than computing all runs. In: 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), vol. 30, pp. 582\u2013593. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-540-27798-9_46","volume-title":"Computing and Combinatorics","author":"H Leung","year":"2004","unstructured":"Leung, H., Peng, Z., Ting, H.-F.: An efficient online algorithm for square detection. In: Chwa, K.-Y., Munro, J.I. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 432\u2013439. Springer, Heidelberg (2004)"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-82456-2_18","volume-title":"Combinatorial Algorithms on Words","author":"MG Main","year":"1985","unstructured":"Main, M.G., Lorentz, R.J.: Linear time recognition of squarefree strings. In: Apostolico, A., Galil, Z. (eds.) Combinatorial Algorithms on Words, pp. 271\u2013278. Springer, Heidelberg (1985)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Shur, A.M.: Generating square-free words efficiently. Accepted to WORDS 2013 Special Issue of Theoretical Computer Science (2014)","DOI":"10.1016\/j.tcs.2015.07.027"},{"key":"25_CR12","unstructured":"Thue, A.: \u00dcber unendliche zeichenreihen (1906). In: Selected Mathematical Papers of Axel Thue. Universitetsforlaget (1977)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: IEEE Conference Record of 14th Annual Symposium on Switching and Automata Theory, SWAT 2008, pp. 1\u201311. IEEE (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19929-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T12:47:06Z","timestamp":1675860426000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19929-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319199283","9783319199290"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19929-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}