{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:36:58Z","timestamp":1648975018676},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0890-5401(03)00162-7","type":"journal-article","created":{"date-parts":[[2003,8,12]],"date-time":"2003-08-12T12:43:24Z","timestamp":1060692204000},"page":"20-67","source":"Crossref","is-referenced-by-count":0,"title":["Parallel two dimensional witness computation"],"prefix":"10.1016","volume":"188","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zvi","family":"Galil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramesh","family":"Hariharan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunsoo","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0890-5401(03)00162-7_BIB1","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1137\/S0097539795298321","article-title":"Two dimensional periodicity","volume":"27","author":"Amir","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0890-5401(03)00162-7_BIB2","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1137\/S0097539792226321","article-title":"An alphabet independent approach to two dimensional pattern matching","volume":"23","author":"Amir","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0890-5401(03)00162-7_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1998.2705","article-title":"Optimal parallel two dimensional text searching on a CREW","volume":"144","author":"Amir","year":"1998","journal-title":"Inf. Comput."},{"key":"10.1016\/S0890-5401(03)00162-7_BIB4","doi-asserted-by":"crossref","unstructured":"A. Apostolico, D. Breslauer, Z. Galil, Optimal parallel algorithms for periods, palindromes and squares, in: Proceedings of the 19th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 623, 1992, pp. 296\u2013307","DOI":"10.1007\/3-540-55719-9_82"},{"key":"10.1016\/S0890-5401(03)00162-7_BIB5","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1137\/0207043","article-title":"A technique for extending rapid exact-match string matching to arrays of more than one dimension","volume":"7","author":"Baker","year":"1978","journal-title":"SIAM J. Comput."},{"issue":"5","key":"10.1016\/S0890-5401(03)00162-7_BIB6","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0020-0190(77)90017-5","article-title":"Two dimensional pattern matching","volume":"6","author":"Bird","year":"1977","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/S0890-5401(03)00162-7_BIB7","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1137\/0219072","article-title":"An optimal O(loglogm) time parallel string matching algorithm","volume":"19","author":"Breslauer","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0890-5401(03)00162-7_BIB8","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."},{"issue":"4","key":"10.1016\/S0890-5401(03)00162-7_BIB9","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1137\/S009753979528007X","article-title":"Constant-time randomized parallel string matching","volume":"26","author":"Crochemore","year":"1997","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0890-5401(03)00162-7_BIB10","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1137\/S0097539795280068","article-title":"An optimal constant time parallel algorithm for 2D pattern matching","volume":"27","author":"Crochemore","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0890-5401(03)00162-7_BIB11","doi-asserted-by":"crossref","unstructured":"R. Cole, M. Crochemore, Z. Galil, L. Gasieniec, R. Hariharan, S. Muthukrishnan, K. Park, W. Rytter, Optimal parallel algorithms for preprocessing and pattern matching in one and two dimensions, in: Proceedings of the 34rd IEEE Symposium on the Foundations of Computer Science, 1993, pp. 248\u2013257","DOI":"10.1109\/SFCS.1993.366862"},{"key":"10.1016\/S0890-5401(03)00162-7_BIB12","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/0217037","article-title":"Relations between concurrent-write models of parallel computation","volume":"17","author":"Fich","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0890-5401(03)00162-7_BIB13","doi-asserted-by":"crossref","unstructured":"L. Gasieniec, K. Park, Work-Time optimal parallel prefix matching, in: Proceedings of the European Symposium on Algorithms, 1994, pp. 471\u2013482","DOI":"10.1007\/BFb0049432"},{"key":"10.1016\/S0890-5401(03)00162-7_BIB14","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1137\/S0097539792241941","article-title":"Alphabet-independent two dimensional witness computation","volume":"25","author":"Galil","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0890-5401(03)00162-7_BIB15","series-title":"Introduction to Parallel Algorithms","author":"JaJa","year":"1991"},{"key":"10.1016\/S0890-5401(03)00162-7_BIB16","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1137\/S0097539792190157","article-title":"Parallel suffix\u2013prefix-matching algorithm and application","volume":"25","author":"Kedem","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0890-5401(03)00162-7_BIB17","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","article-title":"An O(nlogn) algorithm for finding all repetitions in a string","volume":"5","author":"Main","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/S0890-5401(03)00162-7_BIB18","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1006\/jagm.1993.1019","article-title":"The parallel simplicity of compaction and chaining","volume":"14","author":"Ragde","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0890-5401(03)00162-7_BIB19","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(85)80028-0","article-title":"Optimal pattern matching in strings","volume":"67","author":"Vishkin","year":"1985","journal-title":"Inf. Control"},{"key":"10.1016\/S0890-5401(03)00162-7_BIB20","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1137\/0220002","article-title":"Deterministic sampling\u2014A new technique for fast pattern matching","volume":"20","author":"Vishkin","year":"1991","journal-title":"SIAM J. Comput."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103001627?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540103001627?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T15:20:57Z","timestamp":1552576857000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540103001627"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0890540103001627"],"URL":"https:\/\/doi.org\/10.1016\/s0890-5401(03)00162-7","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}