{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:44:14Z","timestamp":1720640654176},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s1571-0653(04)00476-7","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T13:34:04Z","timestamp":1113053644000},"page":"82-93","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Optimal Parallel Searching an Array for Certain Repetitions"],"prefix":"10.1016","volume":"12","author":[{"given":"Valentin E.","family":"Brimkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00476-7_BIB1","first-page":"440","article-title":"Two-dimensional periodicity and its applications","author":"Amir","year":"1992","journal-title":"Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms"},{"issue":"6","key":"10.1016\/S1571-0653(04)00476-7_BIB2","doi-asserted-by":"crossref","first-page":"1318","DOI":"10.1137\/S0097539793260404","article-title":"An optimal O(log log n) time parallel algorithm for detecting all squares in strings","volume":"25","author":"Apostolico","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S1571-0653(04)00476-7_BIB3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0304-3975(98)00182-0","article-title":"Fibonacci arrays and their two-dimensional repetitions","volume":"237","author":"Apostolico","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S1571-0653(04)00476-7_BIB4","first-page":"17","article-title":"Repetitions in two-dimensional arrays","author":"Apostolico","year":"1997","journal-title":"Purdue CS TR- 97 - 040"},{"key":"10.1016\/S1571-0653(04)00476-7_BIB5","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","article-title":"Optimal off-line detection of repetitions in a string","volume":"22","author":"Apostolico","year":"1983","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S1571-0653(04)00476-7_BIB6","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/0022-0000(85)90060-1","article-title":"Structural properties of the string statistic problem","volume":"31","author":"Apostolico","year":"1985","journal-title":"J. Comput. Systems"},{"key":"10.1016\/S1571-0653(04)00476-7_BIB7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"Evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/S1571-0653(04)00476-7_BIB8","doi-asserted-by":"crossref","unstructured":"Brimkov V.E., Optimally fast parallel testing 2D-arrays for existence of repetitive patterns, Proc. 8th IWCIA, Caen (2000) 23-38. Extended version appeared in Int. J. of Pattern Recognition and Artificial Intelligence 15(7) (2001) 1167-1182","DOI":"10.1142\/S0218001401001349"},{"key":"10.1016\/S1571-0653(04)00476-7_BIB9","doi-asserted-by":"crossref","unstructured":"Cole, R., M. Crochemore, Z. Galil, L. Gasieniec, R. Hariharan, S. Muthukrishnan, K. Park, W. Rytter, Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions, Proc. 34th IEEE Symp. Found. Computer Science (1993) 248-258","DOI":"10.1109\/SFCS.1993.366862"},{"issue":"5","key":"10.1016\/S1571-0653(04)00476-7_BIB10","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","article-title":"An optimal algorithm for computing the repetitions in a word","volume":"12","author":"Crochemore","year":"1981","journal-title":"Inform. Process. Let."},{"issue":"3","key":"10.1016\/S1571-0653(04)00476-7_BIB11","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/0217037","article-title":"Relations between CR-models of parallel computations","volume":"17","author":"Fich","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S1571-0653(04)00476-7_BIB12","doi-asserted-by":"crossref","unstructured":"Galil Z., Park K., Truly alphabet-independent two-dimensional pattern matching, Proc. 33rd IEEE Symp. Found. Computer Science (1992) 247-256","DOI":"10.1109\/SFCS.1992.267767"},{"key":"10.1016\/S1571-0653(04)00476-7_BIB13","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","article-title":"An O(n log n) algorithm for finding all repetitions in a string","volume":"5","author":"Main","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/S1571-0653(04)00476-7_BIB14","first-page":"1","article-title":"\u00fcber unendliche Zeichenreihen, Norske Vid. Selsk","volume":"7","author":"Thue","year":"1906","journal-title":"I Mat. Natur. Kl. Skr., Christiania"},{"issue":"1","key":"10.1016\/S1571-0653(04)00476-7_BIB15","first-page":"1","article-title":"\u00fcber die gegenseitige Lage gleicher Zeichenreihen","author":"Thue","year":"1912","journal-title":"Norske Vid. Selsk. I Mat. Natur. Kl. Skr. Christiania"},{"key":"10.1016\/S1571-0653(04)00476-7_BIB16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(85)80028-0","article-title":"Optimal parallel pattern matching in strings","volume":"67","author":"Vishkin","year":"1985","journal-title":"Information and Control"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004767?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004767?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,10]],"date-time":"2019-02-10T15:24:28Z","timestamp":1549812268000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304004767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":16,"alternative-id":["S1571065304004767"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00476-7","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}