{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:34:14Z","timestamp":1794357254788,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":20,"publisher":"Springer US","isbn-type":[{"value":"9780387307701","type":"print"},{"value":"9780387301624","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_246","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T14:35:29Z","timestamp":1214490929000},"page":"556-559","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","reference":[{"key":"246_CR1_246","unstructured":"Amir, A., Benson, G.: Efficient two dimensional compressed matching. In: Proceeding of Data Compression Conference, Snow Bird, Utah, 1992, pp.\u00a0279\u2013288"},{"key":"246_CR2_246","unstructured":"Amir, A., Benson, G.: Two\u2010dimensional periodicity and its application. Proceeding of 3rd Symposium on Discrete Algorithms, Orlando, FL, 1992, pp.\u00a0440\u2013452"},{"issue":"1","key":"246_CR3_246","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/S0097539795298321","volume":"27","author":"A. Amir","year":"1998","unstructured":"Amir, A., Benson, G.: Two\u2010dimensional periodicity and its application. SIAM J.\u00a0Comput. 27(1), 90\u2013106 (1998)","journal-title":"SIAM J. Comput."},{"key":"246_CR4_246","doi-asserted-by":"crossref","unstructured":"Amir, A., Benson, G., Farach, M.: The truth, the whole truth, and nothing but the truth: Alphabet independent two dimensional witness table construction.Technical Report GIT-CC-92\/52, Georgia Institute of Technology (1992)","DOI":"10.1145\/129712.129719"},{"issue":"2","key":"246_CR5_246","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.: An alphabet independent approach to two dimensional pattern matching. SIAM J.\u00a0Comput. 23(2), 313\u2013323 (1994)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"246_CR6_246","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.: Optimal two\u2010dimensional compressed matching. J.\u00a0Algorithms 24(2), 354\u2013379 (1997)","journal-title":"J. Algorithms"},{"issue":"1","key":"246_CR7_246","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.: Optimal parallel two dimensional text searching on a\u00a0crew pram. Inf. Comput. 144(1), 1\u201317 (1998)","journal-title":"Inf. Comput."},{"issue":"2","key":"246_CR8_246","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.: Inplace 2d matching in compressed images. J.\u00a0Algorithms 49(2), 240\u2013261 (2003)","journal-title":"J. Algorithms"},{"issue":"3","key":"246_CR9_246","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.: Inplace run-length 2d compressed search. Theor. Comput. Sci. 290(3), 1361\u20131383 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"246_CR10_246","volume-title":"On the complexity of pattern matching for highly compressed two dimensional texts. Proceeding of 8th Annual Symposium on Combinatorial Pattern Matching (CPM 97). LNCS, vol. 1264, pp. 40\u201351","author":"P. Berman","year":"1997","unstructured":"Berman, P., Karpinski, M., Larmore, L., Plandowski, W., Rytter, W.: On the complexity of pattern matching for highly compressed two dimensional texts. Proceeding of 8th Annual Symposium on Combinatorial Pattern Matching (CPM 97). LNCS, vol.\u00a01264, pp.\u00a040\u201351. Springer, Berlin (1997)"},{"key":"246_CR11_246","unstructured":"Crochemore, M., Galil, Z., Gasieniec, L., Hariharan, R., Muthukrishnan, S., Park, K., Ramesh, H., Rytter, W.: Parallel two\u2010dimensional pattern matching. In: Proceeding of 34th Annual IEEE FOCS, 1993, pp.\u00a0248\u2013258"},{"issue":"5","key":"246_CR12_246","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1137\/S0097539792241941","volume":"25","author":"Z. Galil","year":"1996","unstructured":"Galil, Z., Park, K.: Alphabet\u2010independent two\u2010dimensional witness computation. SIAM. J.\u00a0Comput. 25(5), 907\u2013935 (1996)","journal-title":"SIAM. J. Comput."},{"key":"246_CR13_246","volume-title":"Computer Architeture: A Quantitative Approach","author":"J.L. Hennessy","year":"1996","unstructured":"Hennessy, J.L., Patterson, D.A.: Computer Architeture: A\u00a0Quantitative Approach, 2nd\u00a0edn. Morgan Kaufmann, San Francisco, CA (1996)","edition":"2"},{"key":"246_CR14_246","unstructured":"Klein, S.T., Shapira, D.: Compressed pattern matching in jpeg images. In: Proceeding Prague Stringology conference, 2005, pp.\u00a0125\u2013134"},{"issue":"5","key":"246_CR15_246","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1093\/comjnl\/46.5.487","volume":"46","author":"S.T. Klein","year":"2003","unstructured":"Klein, S.T., Wiseman, Y.: Parallel huffman decoding with applications to jpeg files. Comput. J.\u00a046(5), 487\u2013497 (2003)","journal-title":"Comput. J."},{"key":"246_CR16_246","doi-asserted-by":"crossref","unstructured":"Park, K., Galil, Z.: Truly alphabet\u2010independent two\u2010dimensional pattern matching. In: Proceeding 33rd IEEE FOCS, 1992, pp.\u00a0247\u2013256","DOI":"10.1109\/SFCS.1992.267767"},{"key":"246_CR17_246","unstructured":"R\u00e9gnier, M., Rostami, L.: A\u00a0unifying look at d-dimensional periodicities and space coverings. In: 4th Symp. on Combinatorial Pattern Matching, 15, 1993"},{"key":"246_CR18_246","doi-asserted-by":"crossref","unstructured":"Vishkin, U.: Optimal parallel pattern matching in strings. In: Proceeding 12th ICALP, 1985, pp.\u00a091\u2013113","DOI":"10.1016\/S0019-9958(85)80028-0"},{"key":"246_CR19_246","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MC.1984.1659158","volume":"17","author":"T.A. Welch","year":"1984","unstructured":"Welch, T.A.: A\u00a0technique for high\u2010performance data compression. IEEE Comput. 17, 8\u201319 (1984)","journal-title":"IEEE Comput."},{"key":"246_CR20_246","unstructured":"Ziv, J.: Personal communication (1995)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T23:16:17Z","timestamp":1662160577000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_246"}},"subtitle":["2003; Amir, Landau, Sokol"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_246","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008]]}}}