{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:47:01Z","timestamp":1787500021222,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540580942","type":"print"},{"value":"9783540484509","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58094-8_11","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:11:27Z","timestamp":1330251087000},"page":"125-135","source":"Crossref","is-referenced-by-count":2,"title":["An alphabet-independent optimal parallel search for three dimensional pattern"],"prefix":"10.1007","author":[{"given":"Marek","family":"Karpinski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"11_CR1","unstructured":"A. Amir, G. Benson. Two dimensional periodicity in rectangular arrays. SODA'92, 440\u2013452"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"A. Amir, G. Benson, M. Farach. Alphabet independent two dimensional matching. STOC'92, 59\u201368.","DOI":"10.1145\/129712.129719"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"A. Amir, G. Benson, M. Farach. Parallel two dimensional matching in logarithmic time. SPAA'93, 79\u201385.","DOI":"10.1145\/165231.165242"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1137\/0207043","volume":"7","author":"T. J. Baker","year":"1978","unstructured":"T. J. Baker. A technique for extending rapid exact-match string matching to arrays of more than one dimension. SIAM J. Comp. 7 (1978) 533\u2013541.","journal-title":"SIAM J. Comp."},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0020-0190(77)90017-5","volume":"6","author":"R. S. Bird","year":"1977","unstructured":"R. S. Bird. Two dimensional pattern matching. Inf. Proc. letters 6, (1977) 168\u2013170.","journal-title":"Inf. Proc. letters"},{"key":"11_CR6","unstructured":"R. Cole, 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. FOCS'93."},{"key":"11_CR7","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, W. Rytter. Usefullness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays. Theoretical Computer Science 88 (1991) 59\u201362.","journal-title":"Theoretical Computer Science"},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/S0019-9958(85)80031-0","volume":"67","author":"Z. Galil","year":"1985","unstructured":"Z. Galil. Optimal parallel algorithms for string matching. Information and Control 67 (1985) 144\u2013157.","journal-title":"Information and Control"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Z. Galil, K. Park. Truly alphabet independent two dimensional matching. FOCS'92, (1992) 247\u2013256.","DOI":"10.1109\/SFCS.1992.267767"},{"key":"11_CR10","unstructured":"Z. Kedem, G. Landau, K. Palem. Optimal parallel prefix-suffix matching algorithm and application. SPAA'89 (1989) 388\u2013398."},{"key":"11_CR11","unstructured":"R. Karp, R. Miller, A. Rosenberg. Rapid identification of repeated patterns in strings, trees and arrays. STOC'72 (1972) 125\u2013136."},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R. Karp","year":"1987","unstructured":"R. Karp, M. O. Rabin. Efficient randomized pattern matching algorithms. IBM Journal of Res. and Dev. 31 (1987) 249\u2013260.","journal-title":"IBM Journal of Res. and Dev."},{"key":"11_CR13","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 pattern matching in strings. Information and Control 67 (1985) 91\u2013113.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58094-8_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T18:19:07Z","timestamp":1742581147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58094-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580942","9783540484509"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-58094-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}