{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:00Z","timestamp":1759637940195},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1007\/bf01191471","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T07:09:40Z","timestamp":1108710580000},"page":"89-108","source":"Crossref","is-referenced-by-count":21,"title":["Fast parallel Lyndon factorization with applications"],"prefix":"10.1007","volume":"28","author":[{"given":"A.","family":"Apostolico","sequence":"first","affiliation":[]},{"given":"M.","family":"Crochemore","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A. V., J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(78)90073-X","volume":"7","author":"A. G. Akl","year":"1978","unstructured":"Akl, A. G., and T. G. Toussaint, An Improved Algorithm To Check for Polygon Similarity,Information Processing Letters,7, 127?128 (1978).","journal-title":"Information Processing Letters"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1137\/0219066","volume":"19","author":"A. Apostolico","year":"1990","unstructured":"Apostolico, A., M. J. Atallah, L. L. Larmore, and H. S. McFaddin, Efficient Parallel Algorithms for String Editing and Related Problems,Proceedings of the 26th Allerton Conference on Communications, Control, and Computing, Monticello, IL, Sept. 1988. Also inSIAM Journal on Computing,19, 968?988 (1990).","journal-title":"SIAM Journal on Computing"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0890-5401(91)90016-U","volume":"95","author":"A. Apostolico","year":"1991","unstructured":"Apostolico, A., and M. Crochemore, Optimal Canonization of All Substrings of a String,Information and Computation,95, 76?95 (1991).","journal-title":"Information and Computation"},{"key":"CR5","series-title":"NATO ASI Series F","volume-title":"Combinatorial Algorithms on Words","year":"1985","unstructured":"Apostolico, A., and Z. Galil (eds.),Combinatorial Algorithms on Words, NATO ASI Series F, Vol. 12, Springer-Verlag, New York, 1985."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01762122","volume":"3","author":"A. Apostolico","year":"1988","unstructured":"Apostolico, A., C. Iliopoulos, G. Landau, B. Schieber, and U. Vishkin, Parallel Construction of a Suffix Tree, with Applications,Algorithmica,3, 347?365 (1988).","journal-title":"Algorithmica"},{"issue":"3","key":"CR7","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/65950.65958","volume":"36","author":"P. Beame","year":"1989","unstructured":"Beame, P., and J. Hastad, Optimal Bounds for Decision Problems on the CRCW PRAM,Journal of the Association for Computing Machinery,36(3), 643?670 (1989).","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Berkman, O., D. Breslauer, Z. Galil, B. Schieber, and U. Vishkin, Highly Parallelizable Problems,Proceedings of the 21st ACM Symposium on Theory of Computing, Seattle, WA, May 1989, pp. 309?319.","DOI":"10.1145\/73007.73036"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.2307\/1970044","volume":"68","author":"K. T. Chen","year":"1958","unstructured":"Chen, K. T., R. H. Fox, and R. C. Lyndon, Free Differential Calculus, IV,Annals of Mathematics,68, 81?95 (1958).","journal-title":"Annals of Mathematics"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1145\/116825.116845","volume":"38","author":"M. Crochemore","year":"1991","unstructured":"Crochemore, M., and D. Perrin, Two-Way String-Matching,Journal of the Association for Computing Machinery,38, 651?675 (1991).","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(91)90073-B","volume":"88","author":"M. Crochemore","year":"1991","unstructured":"Crochemore, M., and W. Rytter, Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays,Theoretical Computer Science,88, 59?82 (1991).","journal-title":"Theoretical Computer Science"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"J. P. Duval","year":"1983","unstructured":"Duval, J. P., Factorizing Words over an Ordered Alphabet,Journal of Algorithms,4, 363?381 (1983).","journal-title":"Journal of Algorithms"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/0217037","volume":"17","author":"F. E. Fich","year":"1988","unstructured":"Fich, F. E., R. L. Ragde, and A. Wigderson, Relations Between Concurrent-Write Models of Parallel Computation,SIAM Journal on Computing,17, 606?627 (1988).","journal-title":"SIAM Journal on Computing"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/S0019-9958(85)80031-0","volume":"67","author":"Z. Galil","year":"1985","unstructured":"Galil, Z., Optimal Parallel Algorithms for String Matching,Information and Control,67, 144?157 (1985).","journal-title":"Information and Control"},{"key":"CR15","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1982","unstructured":"Lothaire, M.,Combinatorics on Words, Addison-Wesley, Reading, MA, 1982."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(85)90159-8","volume":"40","author":"R. R. Paige","year":"1985","unstructured":"Paige, R. R., R. Tarjan, and R. Bonic, A Linear Time Solution to the Single Function Coarsest Partition Problem,Theoretical Computer Science,40, 67?84 (1985).","journal-title":"Theoretical Computer Science"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0196-6774(81)90013-4","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Shiloach, Y., Fast Canonization of Circular Strings,Journal of Algorithms,2, 107?121 (1981).","journal-title":"Journal of Algorithms"},{"issue":"1","key":"CR18","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(90)90170-3","volume":"35","author":"R. Siromoney","year":"1990","unstructured":"Siromoney, R., and L. Mathew, A Public Key Cryptosystem Based on Lyndon Words,Information Processing Letters,35(1), 33?36 (1990).","journal-title":"Information Processing Letters"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01191471.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01191471\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01191471","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T09:08:35Z","timestamp":1556615315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01191471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["BF01191471"],"URL":"https:\/\/doi.org\/10.1007\/bf01191471","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}