{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T13:27:33Z","timestamp":1770557253935,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1995,10]]},"DOI":"10.1007\/bf01294132","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T22:39:08Z","timestamp":1111703948000},"page":"355-366","source":"Crossref","is-referenced-by-count":29,"title":["Finding all periods and initial palindromes of a string in parallel"],"prefix":"10.1007","volume":"14","author":[{"given":"D.","family":"Breslauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z.","family":"Galil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"A. Apostolico and D. Breslauer. An optimalO(log logn) time parallel algorithm for detecting all squares in a string.SIAM J. Comput., to appear."},{"key":"CR2","series-title":"Lecture Notes in Computer Science, Vol. 623","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/3-540-55719-9_82","volume-title":"Proc. 19th Internat. Colloq. on Automata, Languages, and Programming","author":"A. Apostolico","year":"1992","unstructured":"A. Apostolico, D. Breslauer, and Z. Galil. Optimal parallel algorithms for periods, palindromes and squares.Proc. 19th Internat. Colloq. on Automata, Languages, and Programming. Lecture Notes in Computer Science, Vol. 623. Springer-Verlag, Berlin, 1992, pages 296?307."},{"key":"CR3","volume-title":"Palindromes and Anagrams","author":"H. W. Bergerson","year":"1973","unstructured":"H. W. Bergerson.Palindromes and Anagrams. Dover. New York, 1973."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R. P. Brent","year":"1974","unstructured":"R. P. Brent. Evaluation of general arithmetic expressions.J. Assoc. Comput. Mach., 21:201?206, 1974.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR5","volume-title":"Ph.D. thesis","author":"D. Breslauer","year":"1992","unstructured":"D. Breslauer. Efficient String Algorithmics. Ph.D. thesis, Department of Computer Science, Columbia University, New York, 1992."},{"issue":"2","key":"CR6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0304-3975(94)00177-K","volume":"137","author":"D. Breslauer","year":"1995","unstructured":"D. Breslauer. Fast parallel string prefix-matching.Theoret. Comput. Sci., 137(2):269?278, 1995.","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"CR7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(94)90060-4","volume":"49","author":"D. Breslauer","year":"1994","unstructured":"D. Breslauer. Testing string superprimitivity in parallel.Inform. Process. Lett., 49:5 235?241, 1994.","journal-title":"Inform. Process. Lett."},{"issue":"6","key":"CR8","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1137\/0219072","volume":"19","author":"D. Breslauer","year":"1990","unstructured":"D. Breslauer and Z. Galil. An optimalO(log logn) time parallel string matching algorithm.SIAM J. Comput., 19(6): 1051?1058, 1990.","journal-title":"SIAM J. Comput."},{"issue":"5","key":"CR9","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1137\/0221050","volume":"21","author":"D. Breslauer","year":"1992","unstructured":"D. Breslauer and Z. Galil. A lower bound for parallel string matching.SIAM J. Comput., 21(5):856?862. 1992.","journal-title":"SIAM J. Comput."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(91)90073-B","volume":"88","author":"M. Crochemore","year":"1991","unstructured":"M. Crochemore and W. Rytter. Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays.Theoret. Comput. Sci., 88:59?82, 1991.","journal-title":"Theoret. Comput. Sci."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"F. E. Fich, R. L. Radge, and A. Wigderson. Relations between concurrent-write models of parallel computation.Proc. 3rd ACM Symp. on Principles of Distributed Computing, 1984, pages 179?189.","DOI":"10.1145\/800222.806745"},{"key":"CR12","first-page":"113","volume-title":"Complexity of Computation","author":"M. J. Fischer","year":"1974","unstructured":"M. J. Fischer and M. S. Paterson. Sring matching and other produces. In R. M. Karp, editor,Complexity of Computation. American Mathematical Society, Providence, RI, 1974, pages 113?125."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/S0019-9958(85)80031-0","volume":"67","author":"G. Galil","year":"1985","unstructured":"G. Galil. Optimal parallel algorithms for string matching.Inform. and Control. 67:144?157, 1985.","journal-title":"Inform. and Control"},{"key":"CR14","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"J. E. Hopcroft and J. D. Ullman.Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, MA, 1979."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"R. M. Karp, R. E. Miller, and A. L. Rosenberg. Rapid identification of repeated patterns in strings, trees and arrays.Proc. 4th ACM Symp. on Theory of Computing, 1972, pages 125?136.","DOI":"10.1145\/800152.804905"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"Z. Kedem, G. M. Landau, and K. Palem. Optimal parallel suffix-prefix matching algorithm and applications.Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, 1989, pages 388?398.","DOI":"10.1145\/72935.72977"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0206024","volume":"6","author":"D. E. Knuth","year":"1977","unstructured":"D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matching in strings.SIAM J. Comput., 6:322?350, 1977.","journal-title":"SIAM J. Comput."},{"key":"CR18","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"M. Lothaire.Combinatorics on Words. Addison-Wesley, Reading, MA, 1983."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"R. C. Lyndon","year":"1962","unstructured":"R. C. Lyndon and M. P. Schutzenberger. The equation am=bncp in a free group.Michigan Math. J., 9:289?298, 1962.","journal-title":"Michigan Math. J."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1145\/321892.321896","volume":"22","author":"G. Manacher","year":"1975","unstructured":"G. Manacher. A new linear-time ?On-line? algorithm for finding the smallest initial palindrome of a string.J. Assoc. Comput. Mach., 22:346?351, 1975.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","volume":"4","author":"L. G. Valiant","year":"1975","unstructured":"L. G. Valiant. Parallelism in comparison models.SIAM J. Comput., 4:348?355, 1975.","journal-title":"SIAM J. Comput."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(85)80028-0","volume":"67","author":"U. Vishkin","year":"1985","unstructured":"U. Vishkin. Optimal parallel pattern matching in strings.Inform. and Control, 67:91?113, 1985.","journal-title":"Inform. and Control"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01294132.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01294132\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01294132","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T07:18:34Z","timestamp":1556781514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01294132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["BF01294132"],"URL":"https:\/\/doi.org\/10.1007\/bf01294132","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}