{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T00:44:40Z","timestamp":1792111480307,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":19,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_246","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:06Z","timestamp":1461268986000},"page":"1366-1369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multidimensional Compressed Pattern Matching"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"246_CR13713","doi-asserted-by":"crossref","unstructured":"Amir A, Benson G (1992) Efficient two dimensional compressed matching. In: Proceeding of data compression conference, Snow Bird, pp 279\u2013288","DOI":"10.1109\/DCC.1992.227453"},{"key":"246_CR13714","unstructured":"Amir A, Benson G (1992) Two-dimensional periodicity and its application. In: Proceeding of 3rd symposium on discrete algorithms, Orlando, pp 440\u2013452"},{"issue":"1","key":"246_CR13715","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/S0097539795298321","volume":"27","author":"A Amir","year":"1998","unstructured":"Amir A, Benson G (1998) Two-dimensional periodicity and its application. SIAM J Comput 27(1):90\u2013106","journal-title":"SIAM J Comput"},{"key":"246_CR13716","doi-asserted-by":"crossref","unstructured":"Amir A, Benson G, Farach M (1992) The truth, the whole truth, and nothing but the truth: alphabet independent two dimensional witness table construction. Technical Report GITCC-92\/52, Georgia Institute of Technology","DOI":"10.1145\/129712.129719"},{"issue":"2","key":"246_CR13717","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/S0097539792226321","volume":"23","author":"A Amir","year":"1994","unstructured":"Amir A, Benson G, Farach M (1994) An alphabet independent approach to two dimensional patternmatching. SIAM J Comput 23(2):313\u2013323","journal-title":"SIAM J Comput"},{"issue":"2","key":"246_CR13718","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1006\/jagm.1997.0860","volume":"24","author":"A Amir","year":"1997","unstructured":"Amir A, Benson G, Farach M (1997) Optimal two-dimensional compressed matching. J Algorithms 24(2):354\u2013379","journal-title":"J Algorithms"},{"issue":"1","key":"246_CR13719","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2705","volume":"144","author":"A Amir","year":"1998","unstructured":"Amir A, Benson G, Farach M (1998) Optimal parallel two dimensional text searching on a crew pram. Inf Comput 144(1):1\u201317","journal-title":"Inf Comput"},{"issue":"2","key":"246_CR13720","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/S0196-6774(03)00088-9","volume":"49","author":"A Amir","year":"2003","unstructured":"Amir A, Landau G, Sokol D (2003) Inplace 2D matching in compressed images. J Algorithms 49(2):240\u2013261","journal-title":"J Algorithms"},{"issue":"3","key":"246_CR13721","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1016\/S0304-3975(02)00041-5","volume":"290","author":"A Amir","year":"2003","unstructured":"Amir A, Landau G, Sokol D (2003) Inplace run-length 2D compressed search. Theory Comput Sci 290(3):1361\u20131383","journal-title":"Theory Comput Sci"},{"key":"246_CR13722","doi-asserted-by":"crossref","unstructured":"Berman P, Karpinski M, Larmore L, Plandowski W, Rytter W (1997) On the complexity of pattern matching for highly compressed two dimensional texts. In: Proceeding of 8th annual symposium on combinatorial pattern matching (CPM 97). LNCS, vol 1264. Springer, Berlin, pp 40\u201351","DOI":"10.1007\/3-540-63220-4_48"},{"key":"246_CR13723","unstructured":"Crochemore M, Galil Z, Gasieniec L, Hariharan R, Muthukrishnan S, Park K, Ramesh H, Rytter W (1993) Parallel two-dimensional pattern matching. In: Proceeding of 34th annual IEEE FOCS, pp 248\u2013258"},{"issue":"5","key":"246_CR13724","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1137\/S0097539792241941","volume":"25","author":"Z Galil","year":"1996","unstructured":"Galil Z, Park K (1996) Alphabet-independent two-dimensional witness computation. SIAM J Comput 25(5):907\u2013935","journal-title":"SIAM J Comput"},{"key":"246_CR13725","volume-title":"Computer architecture: a quantitative approach","author":"JL Hennessy","year":"1996","unstructured":"Hennessy JL, Patterson DA (1996) Computer architecture: a quantitative approach, 2nd edn. Morgan Kaufmann, San Francisco","edition":"2"},{"key":"246_CR13726","unstructured":"Klein ST, Shapira D (2005) Compressed pattern matching in JPEG images. In: Proceeding Prague stringology conference, pp 125\u2013134"},{"issue":"5","key":"246_CR13727","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1093\/comjnl\/46.5.487","volume":"46","author":"ST Klein","year":"2003","unstructured":"Klein ST, Wiseman Y (2003) Parallel huffman decoding with applications to JPEG files. Comput J 46(5):487\u2013497","journal-title":"Comput J"},{"key":"246_CR13728","doi-asserted-by":"crossref","unstructured":"Park K, Galil Z (1992) Truly alphabet-independent two-dimensional pattern matching. In: Proceeding 33rd IEEE FOCS, pp 247\u2013256","DOI":"10.1109\/SFCS.1992.267767"},{"key":"246_CR13729","doi-asserted-by":"crossref","unstructured":"R\u00e9gnier M, Rostami L (1993) A unifying look at d-dimensional periodicities and space coverings. In: 4th symposium on combinatorial pattern matching, p 15","DOI":"10.1007\/BFb0029807"},{"key":"246_CR13730","doi-asserted-by":"crossref","unstructured":"Vishkin U (1985) Optimal parallel pattern matching in strings. In: Proceeding 12th ICALP, pp 91\u2013113","DOI":"10.1016\/S0019-9958(85)80028-0"},{"key":"246_CR13731","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MC.1984.1659158","volume":"17","author":"TA Welch","year":"1984","unstructured":"Welch TA (1984) A technique for high-performance data compression. IEEE Comput 17:8\u201319","journal-title":"IEEE Comput"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:56:08Z","timestamp":1792108568000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_246"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_246","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}