{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,28]],"date-time":"2026-09-28T22:52:30Z","timestamp":1790635950419,"version":"4.1.0"},"reference-count":30,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1996,12]]},"abstract":"<jats:p>An optimal $O(\\log \\log n)$-time concurrent-read concurrent-write parallel algorithm for detecting all squares in a string is presented. A tight lower bound shows that over general alphabets, this is the fastest possible optimal algorithm. When p processors are available, the bounds become $\\Theta \\lceil {({{n\\log n)} p}\\rceil + \\log \\log _{\\lceil {1 + {p \/ n}} \\rceil } 2p} )$. The algorithm uses an optimal parallel string-matching algorithm together with periodicity properties to locate the squares within the input string.<\/jats:p>","DOI":"10.1137\/s0097539793260404","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:43:31Z","timestamp":1109227411000},"page":"1318-1331","source":"Crossref","is-referenced-by-count":17,"title":["An Optimal $O(\\log \\log N)$-Time Parallel Algorithm for Detecting all Squares in a String"],"prefix":"10.1137","volume":"25","author":[{"given":"Alberto","family":"Apostolico","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dany","family":"Breslauer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1984180201471"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758848"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"A. Apostolico, D. Breslauer, Z. Galil,  Optimal parallel algorithms for periods, palin-dromes and squares,  Proc. 19th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Comput. Sci., Vol. 623, Springer-Verlag, Berlin,  1992,  296\u2013307","DOI":"10.1007\/3-540-55719-9_82"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90109-3"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1145\/65950.65958"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1979.85.261"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09510-1_2"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"key":"R9","unstructured":"D. Breslauer, Ph.D. Thesis,  Efficient string algorithmics, Department of Computer Science, Columbia University, New York,  1992"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/0219072"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/0221050"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294132"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90024-7"},{"key":"R14","first-page":"221","volume":"18","author":"Crochemore M.","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90041-1"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90223-5"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90073-B"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"M. Crochemore, W. Rytter,  R.  Capocelli, A.  De Santis, U.  Vaccaro,  Periodic prefixes in texts,  Proc. 1991 Sequences Workshop: Sequences II: Methods in Communication, Security and Computer Science, Springer-Verlag, Berlin,  1993,  153\u2013165 0960.68755","DOI":"10.1007\/978-1-4613-9323-8_12"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1137\/0217037"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322244"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90002-8"},{"key":"R22","volume-title":"Introduction to formal language theory","author":"Harrison M.","year":"1978"},{"key":"R23","volume-title":"Combinatorics on words","author":"Lothaire M.","year":"1983"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1307\/mmj\/1028998766"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(84)90021-X"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82456-2_18"},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82456-2_19"},{"key":"R28","unstructured":"R. Ross, R. Winklmann,  Repetitive strings are not context-free, Technical report, CS-81-070, Washington State University, Pullman, WA,  1981"},{"key":"R29","first-page":"1","volume":"7","author":"Thue A.","year":"1906","journal-title":"Norske Vid. Selsk. Skr. Mat. Nat. Kl. (Cristiania)"},{"key":"R30","first-page":"1","volume":"1","author":"Thue A.","year":"1912","journal-title":"Norske Vid. Selsk. Skr. Mat. Nat. Kl. (Cristiania)"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0097539793260404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:14:06Z","timestamp":1787336046000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0097539793260404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":30,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["10.1137\/S0097539793260404"],"URL":"https:\/\/doi.org\/10.1137\/s0097539793260404","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}