{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:57:05Z","timestamp":1742918225063,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857792"},{"type":"electronic","value":"9783540857808"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_16","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:23:54Z","timestamp":1220937834000},"page":"206-215","source":"Crossref","is-referenced-by-count":1,"title":["Bounds on Powers in Strings"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Szil\u00e1rd Zsolt","family":"Fazekas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas","family":"Iliopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inuka","family":"Jayasekera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","volume":"22","author":"A. Apostolico","year":"1983","unstructured":"Apostolico, A., Preparata, F.P.: Optimal off-line detection of repetitions in a string. Theoret. Comput. Sci.\u00a022(3), 297\u2013315 (1983)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"16_CR2","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M. Crochemore","year":"1981","unstructured":"Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Inf. Process. Lett.\u00a012(5), 244\u2013250 (1981)","journal-title":"Inf. Process. Lett."},{"key":"16_CR3","unstructured":"Crochemore, M., Ilie, L.: Maximal repetitions in strings. J. Comput. Syst. Sci. (in press, 2007)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Combinatorial Pattern Matching","author":"M. Crochemore","year":"2008","unstructured":"Crochemore, M., Ilie, L., Tinta, L.: Towards a solution to the \u201cruns\u201d conjecture. In: Ferragina, P., Landau, G.M. (eds.) Combinatorial Pattern Matching. LNCS. Springer, Berlin (in press, 2008)"},{"issue":"5","key":"16_CR5","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 stringsearching. Algorithmica\u00a013(5), 405\u2013425 (1995)","journal-title":"Algorithmica"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Giraud, M.: Not so many runs in strings. In: Martin-Vide, C. (ed.) 2nd International Conference on Language and Automata Theory and Applications (2008)","DOI":"10.1007\/978-3-540-88282-4_22"},{"issue":"1\u20132","key":"16_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0304-3975(96)00141-7","volume":"172","author":"C.S. Iliopoulos","year":"1997","unstructured":"Iliopoulos, C.S., Moore, D., Smyth, W.F.: A characterization of the squares in a Fibonacci string. Theoret. Comput. Sci.\u00a0172(1\u20132), 281\u2013291 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR8","first-page":"596","volume-title":"Proceedings of the 40th IEEE Annual Symposium on Foundations of Computer Science","author":"R. Kolpakov","year":"1999","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proceedings of the 40th IEEE Annual Symposium on Foundations of Computer Science, New York, pp. 596\u2013604. IEEE Computer Society Press, Los Alamitos (1999)"},{"issue":"1","key":"16_CR9","first-page":"159","volume":"1","author":"R. Kolpakov","year":"2000","unstructured":"Kolpakov, R., Kucherov, G.: On maximal repetitions in words. J. Discret. Algorithms\u00a01(1), 159\u2013186 (2000)","journal-title":"J. Discret. Algorithms"},{"key":"16_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words","author":"M. Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press, Cambridge (2005)"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0166-218X(89)90051-6","volume":"25","author":"M.G. Main","year":"1989","unstructured":"Main, M.G.: Detecting leftmost maximal periodicities. Discret. Appl. Math.\u00a025, 145\u2013153 (1989)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"16_CR12","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","volume":"5","author":"M.G. Main","year":"1984","unstructured":"Main, M.G., Lorentz, R.J.: An O(n log n) algorithm for finding all repetitions in a string. J. Algorithms\u00a05(3), 422\u2013432 (1984)","journal-title":"J. Algorithms"},{"key":"16_CR13","unstructured":"Puglisi, S.J., Simpson, J., Smyth, W.F.: How many runs can a string contain? Personal communication (submitted, 2007)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/11672142_14","volume-title":"STACS 2006","author":"W. Rytter","year":"2006","unstructured":"Rytter, W.: The number of runs in a string: Improved analysis of the linear upper bound. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 184\u2013195. Springer, Heidelberg (2006)"},{"issue":"9","key":"16_CR15","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.\u00a0205(9), 1459\u20131469 (2007)","journal-title":"Inf. Comput."},{"key":"16_CR16","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"Thue, A.: Uber unendliche Zeichenreihen. Norske Vid. Selsk. Skr. I Math-Nat. Kl.\u00a07, 1\u201322 (1906)","journal-title":"Norske Vid. Selsk. Skr. I Math-Nat. Kl."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T22:09:21Z","timestamp":1675894161000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}