{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:06:02Z","timestamp":1758269162556,"version":"3.37.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319674278"},{"type":"electronic","value":"9783319674285"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67428-5_3","type":"book-chapter","created":{"date-parts":[[2017,9,5]],"date-time":"2017-09-05T01:22:24Z","timestamp":1504574544000},"page":"27-37","source":"Crossref","is-referenced-by-count":2,"title":["Distinct Squares in Circular Words"],"prefix":"10.1007","author":[{"given":"Mika","family":"Amit","sequence":"first","affiliation":[]},{"given":"Pawe\u0142","family":"Gawrychowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,6]]},"reference":[{"issue":"2","key":"3_CR1","first-page":"465","volume":"19","author":"F Blanchet-Sadri","year":"2009","unstructured":"Blanchet-Sadri, F., Mercas, R., Scott, G.: Counting distinct squares in partial words. Acta Cybern. 19(2), 465\u2013477 (2009)","journal-title":"Acta Cybern."},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.tcs.2015.06.037","volume":"596","author":"W Bland","year":"2015","unstructured":"Bland, W., Smyth, W.F.: Three overlapping squares: the general case characterized and applications. Theor. Comput. Sci. 596, 23\u201340 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"43","key":"3_CR3","doi-asserted-by":"crossref","first-page":"4372","DOI":"10.1016\/j.tcs.2009.07.018","volume":"410","author":"G Castiglione","year":"2009","unstructured":"Castiglione, G., Restivo, A., Sciortino, M.: Circular Sturmian words and Hopcroft\u2019s algorithm. Theor. Comput. Sci. 410(43), 4372\u20134381 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Crochemore, M., Fici, G., Merca\u015f, R., Pissis, S.P.: Linear-time sequence comparison using minimal absent words & applications. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 334\u2013346. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49529-2_25","DOI":"10.1007\/978-3-662-49529-2_25"},{"key":"3_CR5","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., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., Tyczy\u0144ski, W., Wale\u0144, T.: 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). doi: 10.1007\/978-3-642-31265-6_3"},{"issue":"5","key":"3_CR6","doi-asserted-by":"crossref","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(5), 405\u2013425 (1995)","journal-title":"Algorithmica"},{"issue":"1","key":"3_CR7","doi-asserted-by":"crossref","first-page":"N10","DOI":"10.37236\/1671","volume":"9","author":"JD Currie","year":"2002","unstructured":"Currie, J.D.: There are ternary circular square-free words of length $$n$$ for $$n\\ge 18$$ . Electron. J. Comb. 9(1), N10 (2002)","journal-title":"Electron. J. Comb."},{"key":"3_CR8","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). doi: 10.1007\/3-540-45005-X_28"},{"key":"3_CR9","doi-asserted-by":"crossref","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? Discrete Appl. Math. 180, 52\u201369 (2015)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"3_CR10","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/050630180","volume":"20","author":"K Fan","year":"2006","unstructured":"Fan, K., Puglisi, S.J., Smyth, W.F., Turpin, A.: A new periodicity lemma. SIAM J. Discrete Math. 20(3), 656\u2013668 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"N Fine","year":"1965","unstructured":"Fine, N., Wilf, H.: Uniqueness theorems for periodic functions. Proc. Am. Math. Soc. 16, 109\u2013114 (1965)","journal-title":"Proc. Am. Math. Soc."},{"issue":"1","key":"3_CR12","doi-asserted-by":"crossref","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"},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.jda.2012.03.003","volume":"17","author":"F Franek","year":"2012","unstructured":"Franek, F., Fuller, R.C.G., Simpson, J., Smyth, W.F.: More results on overlapping squares. J. Discrete Algorithms 17, 2\u20138 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"3_CR14","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). doi: 10.1007\/978-3-319-23826-5_26"},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"261","DOI":"10.4204\/EPTCS.151.18","volume":"151","author":"L Heged\u00fcs","year":"2014","unstructured":"Heged\u00fcs, L., Nagy, B.: Representations of circular words. AFL. EPTCS 151, 261\u2013270 (2014)","journal-title":"AFL. EPTCS"},{"issue":"1","key":"3_CR16","doi-asserted-by":"crossref","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 112(1), 163\u2013164 (2005)","journal-title":"J. Comb. Theory"},{"issue":"3","key":"3_CR17","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 380(3), 373\u2013376 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR18","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.jda.2011.03.009","volume":"11","author":"E Kopylova","year":"2012","unstructured":"Kopylova, E., Smyth, W.F.: The three squares lemma revisited. J. Discrete Algorithms 11, 3\u201314 (2012)","journal-title":"J. Discrete Algorithms"},{"volume-title":"Algebraic Combinatorics on Words, Encyclopedia of Mathematics and its Applications","year":"2002","key":"3_CR19","unstructured":"Lothaire, M. (ed.): Algebraic Combinatorics on Words, Encyclopedia of Mathematics and its Applications, vol. 90. Cambridge University Press, Cambridge (2002)"},{"key":"3_CR20","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). doi: 10.1007\/978-3-319-23660-5_14"},{"issue":"27","key":"3_CR21","doi-asserted-by":"crossref","first-page":"2922","DOI":"10.1016\/j.tcs.2010.07.005","volume":"412","author":"AB Mass\u00e9","year":"2011","unstructured":"Mass\u00e9, A.B., Brlek, S., Garon, A., Labb\u00e9, S.: Equations on palindromes and circular words. Theor. Comput. Sci. 412(27), 2922\u20132930 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"3_CR22","doi-asserted-by":"crossref","first-page":"R140","DOI":"10.37236\/412","volume":"17","author":"AM Shur","year":"2010","unstructured":"Shur, A.M.: On ternary square-free circular words. Electron. J. Comb. 17(1), R140 (2010)","journal-title":"Electron. J. Comb."},{"issue":"1\u20133","key":"3_CR23","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.tcs.2006.12.002","volume":"374","author":"J Simpson","year":"2007","unstructured":"Simpson, J.: Intersecting periodic words. Theor. Comput. Sci. 374(1\u20133), 58\u201365 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR24","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 550, 66\u201378 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR25","first-page":"1","volume":"7","author":"A Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche zeichenreihen. Norske Vid. Selsk. Skr. I Mat.-Nat. Kl. Christiania 7, 1\u201322 (1906)","journal-title":"Norske Vid. Selsk. Skr. I Mat.-Nat. Kl. Christiania"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67428-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,17]],"date-time":"2020-10-17T03:02:24Z","timestamp":1602903744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67428-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319674278","9783319674285"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67428-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}