{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:40:33Z","timestamp":1725896433783},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_34","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T10:52:03Z","timestamp":1257763923000},"page":"345-355","source":"Crossref","is-referenced-by-count":2,"title":["On the Maximal Number of Cubic Subwords in a String"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Kubica","sequence":"first","affiliation":[]},{"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Wale\u0144","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_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. Theor. Comput. Sci.\u00a022, 297\u2013315 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"34_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-540-70844-5_26","volume-title":"Implementation and Applications of Automata","author":"P. Baturo","year":"2008","unstructured":"Baturo, P., Pi\u0105tkowski, M., Rytter, W.: The number of runs in sturmian words. In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol.\u00a05148, pp. 252\u2013261. Springer, Heidelberg (2008)"},{"issue":"5","key":"34_CR3","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":"34_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-540-85780-8_16","volume-title":"Developments in Language Theory","author":"M. Crochemore","year":"2008","unstructured":"Crochemore, M., Fazekas, S.Z., Iliopoulos, C.S., Jayasekera, I.: Bounds on powers in strings. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol.\u00a05257, pp. 206\u2013215. Springer, Heidelberg (2008)"},{"issue":"5","key":"34_CR5","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.\u00a074(5), 796\u2013807 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-69068-9_27","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.) CPM 2008. LNCS, vol.\u00a05029, pp. 290\u2013302. Springer, Heidelberg (2008)"},{"issue":"5","key":"34_CR7","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\u00a013(5), 405\u2013425 (1995)","journal-title":"Algorithmica"},{"key":"34_CR8","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2003","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2003)"},{"issue":"4","key":"34_CR9","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/S0195-6698(03)00026-X","volume":"24","author":"D. Damanik","year":"2003","unstructured":"Damanik, D., Lenz, D.: Powers in sturmian sequences. Eur. J. Comb.\u00a024(4), 377\u2013390 (2003)","journal-title":"Eur. J. Comb."},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.2307\/2034009","volume":"16","author":"N.J. Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proceedings of the American Mathematical Society\u00a016, 109\u2013114 (1965)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcta.1997.2843","volume":"82","author":"A.S. Freankel","year":"1998","unstructured":"Freankel, A.S., Simpson, J.: How many squares can a string contain? J. of Combinatorial Theory Series A\u00a082, 112\u2013120 (1998)","journal-title":"J. of Combinatorial Theory Series A"},{"key":"34_CR12","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.\u00a05196, pp. 232\u2013239. Springer, Heidelberg (2008)"},{"key":"34_CR13","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. of Combinatorial Theory Series A\u00a0112, 163\u2013164 (2005)","journal-title":"J. of Combinatorial Theory Series A"},{"key":"34_CR14","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. Theoretical Computer Science\u00a0380, 373\u2013376 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"34_CR15","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. Theor. Comput. Sci.\u00a0172(1-2), 281\u2013291 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"34_CR16","unstructured":"Karhumaki, J.: Combinatorics on words. Notes in pdf"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Kolpakov, R.M., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: FOCS, pp. 596\u2013604 (1999)","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"34_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-48321-7_31","volume-title":"Fundamentals of Computation Theory","author":"R.M. Kolpakov","year":"1999","unstructured":"Kolpakov, R.M., Kucherov, G.: On maximal repetitions in words. In: Ciobanu, G., P\u0103un, G. (eds.) FCT 1999. LNCS, vol.\u00a01684, pp. 374\u2013385. Springer, Heidelberg (1999)"},{"key":"34_CR19","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)"},{"issue":"1-2","key":"34_CR20","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. Discrete Applied Mathematics\u00a025(1-2), 145\u2013153 (1989)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"34_CR21","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"},{"issue":"1-3","key":"34_CR22","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.tcs.2008.04.020","volume":"401","author":"S.J. Puglisi","year":"2008","unstructured":"Puglisi, S.J., Simpson, J., Smyth, W.F.: How many runs can a string contain? Theor. Comput. Sci.\u00a0401(1-3), 165\u2013171 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"34_CR23","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":"34_CR24","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":"34_CR25","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"Thue, A.: Uber unendliche zeichenreihen. Norske Vid. Selsk. Skr. I Math-Nat.\u00a07, 1\u201322 (1906)","journal-title":"Norske Vid. Selsk. Skr. I Math-Nat."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:34:33Z","timestamp":1619768073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}