{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T03:20:54Z","timestamp":1768015254143,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0020-0190(94)90060-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"235-241","source":"Crossref","is-referenced-by-count":18,"title":["Testing string superprimitivity in parallel"],"prefix":"10.1016","volume":"49","author":[{"given":"Dany","family":"Breslauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90060-4_BIB1","series-title":"Proc. 19th Internat. Coll. on Automata, Languages, and Programming","first-page":"296","article-title":"Optimal parallel algorithms for periods, palindromes and squares","author":"Apostolico","year":"1992"},{"key":"10.1016\/0020-0190(94)90060-4_BIB2","series-title":"Tech. Rept. 90.5","article-title":"Efficient detection of quasiperiodicities in strings","author":"Apostolico","year":"1990"},{"key":"10.1016\/0020-0190(94)90060-4_BIB3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0020-0190(91)90056-N","article-title":"Optimal superprimitivity testing for string","volume":"39","author":"Apostolico","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)90060-4_BIB4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0222017","article-title":"Recursive star-tree parallel data structure","volume":"22","author":"Berkman","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)90060-4_BIB5","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"},{"issue":"6","key":"10.1016\/0020-0190(94)90060-4_BIB6","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0020-0190(92)90111-8","article-title":"An on-line string superprimitivity test","volume":"44","author":"Breslauer","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)90060-4_BIB7","series-title":"Tech. Rept. CUCS-041-92","article-title":"Fast parallel string prefix-matching","author":"Breslauer","year":"1992"},{"issue":"6","key":"10.1016\/0020-0190(94)90060-4_BIB8","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1137\/0219072","article-title":"An optimal O(log log n) time parallel string matching algorithm","volume":"19","author":"Breslauer","year":"1990","journal-title":"SIAM J. Comput."},{"issue":"5","key":"10.1016\/0020-0190(94)90060-4_BIB9","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1137\/0221050","article-title":"A lower bound for parallel string matching","volume":"21","author":"Breslauer","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)90060-4_BIB10","series-title":"Tech. Rept. CUCS-017-92","article-title":"Finding all periods and initial palindromes of a string in parallel","author":"Breslauer","year":"1992"},{"key":"10.1016\/0020-0190(94)90060-4_BIB11","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/800222.806745","article-title":"Relations between concurrent-write models of parallel computation","author":"Fich","year":"1984","journal-title":"Proc. 3rd ACM Symp. on Principles of Distributed Computing"},{"key":"10.1016\/0020-0190(94)90060-4_BIB12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579170","article-title":"Nonlinearity of Davenport Schinzel sequences and generalized path compression schemes","volume":"6","author":"Hart","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(94)90060-4_BIB13","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0029796","article-title":"Covering a string","author":"Iliopoulos","year":"1993","journal-title":"Proc. 4rd Symp. on Combinatorial Pattern"},{"key":"10.1016\/0020-0190(94)90060-4_BIB14","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/0020-0190(94)90060-4_BIB15","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear set union algorithms","volume":"22","author":"Tarjan","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(94)90060-4_BIB16","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1985"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900604?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900604?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T10:38:12Z","timestamp":1580899092000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094900604"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0020019094900604"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90060-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}