{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:04Z","timestamp":1725564964119},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_46","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T19:01:28Z","timestamp":1283713288000},"page":"432-439","source":"Crossref","is-referenced-by-count":4,"title":["An Efficient Online Algorithm for Square Detection"],"prefix":"10.1007","author":[{"given":"Ho-Fung","family":"Leung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeshan","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hing-Fung","family":"Ting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"46_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 squares in a string. SIAM Journal on Computing\u00a025(6), 1318\u20131331 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"46_CR2","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, E.P.: Optimal off-line detection of repetitions in a string. Theoretical Computer Science\u00a022, 297\u2013315 (1983)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"46_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. Information Processing Letters\u00a012(5), 244\u2013250 (1981)","journal-title":"Information Processing Letters"},{"key":"46_CR4","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W., Crochemore, R.: Text Algorithms. Oxford University Press, Oxford (1994)"},{"key":"46_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)"},{"doi-asserted-by":"crossref","unstructured":"Lee, J.H.M., Leung, H.F., Won, H.W.: Extending genet for non-binary constraint satisfaction problems. In: Proceedings of the 7th International Conference on Tools with Artificial Intelligence, pp. 338\u2013343 (1995)","key":"46_CR6","DOI":"10.1109\/TAI.1995.479651"},{"doi-asserted-by":"crossref","unstructured":"Lee, J.H.M., Leung, H.F., Won, H.W.: Performance of a comprehensive and efficient constraint library based on local search. In: Proceedings of the 11th Australian Join Conference on Artifical Intelligence, pp. 13\u201317 (1998)","key":"46_CR7","DOI":"10.1007\/BFb0095052"},{"key":"46_CR8","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. Journal of Algorithms\u00a05, 422\u2013432 (1984)","journal-title":"Journal of Algorithms"},{"key":"46_CR9","series-title":"NATO ASI Series","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/978-3-642-82456-2_18","volume-title":"Combinatorial Algorithms on Words","author":"M.G. 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. NATO ASI Series, vol.\u00a0F12, pp. 271\u2013278. Springer, Heidelberg (1985)"},{"doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Discovering repetitions in strings. Combinatorial Algorithms on Words, 279\u2013288 (1985)","key":"46_CR10","DOI":"10.1007\/978-3-642-82456-2_19"},{"doi-asserted-by":"crossref","unstructured":"Wong, J.H.Y., Leung, H.F.: Solving fuzzy constraint satisfaction problems with fuzzy genet. In: Proceedings of the 10th IEEE International Conference on Tools with Artificial Intelligence, pp. 180\u2013191 (1998)","key":"46_CR11","DOI":"10.1109\/TAI.1998.744840"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:21:14Z","timestamp":1605741674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}