{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:00Z","timestamp":1725664020378},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582014"},{"type":"electronic","value":"9783540485667"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58201-0_70","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:32:19Z","timestamp":1330252339000},"page":"215-226","source":"Crossref","is-referenced-by-count":9,"title":["Optimal two-dimensional compressed matching"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gary","family":"Benson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Farach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"A. Amir and G. Benson. Efficient two-dimensional compressed matching. Proc. of the IEEE Data Compression Conference, pages 279\u2013288, Mar 1992.","key":"18_CR1","DOI":"10.1109\/DCC.1992.227453"},{"unstructured":"A. Amir and G. Benson. Two-dimensional periodicity and its application. Proc. of the Third Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 440\u2013452, Jan 1992.","key":"18_CR2"},{"doi-asserted-by":"crossref","unstructured":"A. Amir, G. Benson, and M. Farach. Alphabet independent two-dimensional matching. Proc. of the 24th Ann. ACM Symp. on Theory of Computing, pages 59\u201368, 1992. Also to appear in Siam Journal of Computing.","key":"18_CR3","DOI":"10.1145\/129712.129719"},{"doi-asserted-by":"crossref","unstructured":"A. Amir, G. Benson, and M. Farach. The truth, the whole truth, and nothing but the truth: Alphabet independent two dimensional witness table construction. Georgia Tech TR GIT-CC-92\/52, 1992.","key":"18_CR4","DOI":"10.1145\/129712.129719"},{"unstructured":"A. Amir, G. Benson, and M. Farach. Let sleeping files lie: Pattern matching in z-compressed files. Proc. of the Fifth Ann. ACM-SIAM Symp. on Discrete Algorithms, page to appear, 1993.","key":"18_CR5"},{"doi-asserted-by":"crossref","unstructured":"A. Amir, G. Benson, and M. Farach. Optimal parallel two-dimensional pattern matching. Proc. of the Fifth Ann. ACM Symp. on Parallel Algorithms and Architectures, 1993.","key":"18_CR6","DOI":"10.1145\/165231.165242"},{"key":"18_CR7","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 optimal o(log log n) time parallel string matching algorithm. SIAM J. Comput., 19:1051\u20131058, 1990.","journal-title":"SIAM J. Comput."},{"issue":"3","key":"18_CR8","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0209045","volume":"9","author":"M. Brown","year":"1980","unstructured":"M. Brown and R. Tarjan. Design and analysis of a data structure for representing sorted lists. SIAM J. Comput., 9(3):594\u2013614, August 1980.","journal-title":"SIAM J. Comput."},{"unstructured":"T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 1990. Problem 9.3-3, page 180.","key":"18_CR9"},{"unstructured":"M. Crochemore, Z. Galil, L. Gasieniec, S. Muthukrishnan, K. Park, H. Ramesh, and W. Rytter. Constant time optimal parallel algorithm for 2d-pattern matching. Manuscript, 1993.","key":"18_CR10"},{"doi-asserted-by":"crossref","unstructured":"Z. Galil and K. Park. Truly alphabet independent two-dimensional pattern matching. Proc. of the 33rd IEEE Annual Symp. on Foundation of Computer Science, pages 247\u2013256, 1992.","key":"18_CR11","DOI":"10.1109\/SFCS.1992.267767"},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"323","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. Comp., 6:323\u2013350, 1977.","journal-title":"SIAM J. Comp."},{"unstructured":"M. R\u00e9gnier and L. Rostami. A unifying look at d-dimensional periodicities and space coverings. Proc. 4th Symp. on Combinatorial Pattern Matching, 1993.","key":"18_CR13"},{"doi-asserted-by":"crossref","unstructured":"U. Vishkin. Optimal parallel pattern matching in strings. Proc. 12th ICALP, pages 91\u2013113, 1985.","key":"18_CR14","DOI":"10.1007\/BFb0015775"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58201-0_70.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:18:28Z","timestamp":1605629908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58201-0_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582014","9783540485667"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-58201-0_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}