{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T16:23:45Z","timestamp":1784996625042,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540614227","type":"print"},{"value":"9783540685296","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61422-2_148","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:37:21Z","timestamp":1330292241000},"page":"392-403","source":"Crossref","is-referenced-by-count":55,"title":["Efficient algorithms for Lempel-Ziv encoding"],"prefix":"10.1007","author":[{"given":"Leszek","family":"Gasieniec","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wojciech","family":"Plandowski","sequence":"additional","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":"34_CR1","unstructured":"A. Amir, G. Benson and M. Farach, Let sleeping files lie: pattern-matching in Z-compressed files, in SODA '94."},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"A. Amir, G. Benson, Efficient two dimensional compressed matching, Proc. of the 2nd IEEE Data Compression Conference 279\u2013288 (1992).","DOI":"10.1109\/DCC.1992.227453"},{"key":"34_CR3","unstructured":"A. Amir, G. Benson and M. Farach, Optimal two-dimensional compressed matching, in ICALP'94."},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"A. Apostolico, D. Breslauer, Z. Galil, Optimal parallel algorithms for periods, palindromes and squares, in ICALP'92, pp. 296\u2013307.","DOI":"10.1007\/3-540-55719-9_82"},{"key":"34_CR5","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, New York (1994)."},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"M. Farach and M. Thorup, String matching in Lempel-Ziv compressed strings, in STOC'95, pp. 703\u2013712.","DOI":"10.1145\/225058.225288"},{"key":"34_CR7","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)."},{"key":"34_CR8","unstructured":"L. Gasieniec, M. Karpi\u0144ski, W. Plandowski and W. Rytter, Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach, to appear in proceedings of the 7th Combinatorial Pattern Matching, Laguna Beach (1996)."},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"M. Karpinski, W. Rytter and A. Shinohara, Pattern-matching for strings with short description, in Combinatorial Pattern Matching, 1995.","DOI":"10.1007\/3-540-60044-2_44"},{"key":"34_CR10","unstructured":"D. Knuth, The Art of Computing, Vol. II: Seminumerical Algorithms. Second edition. Addison-Wesley, 1981."},{"key":"34_CR11","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"22","author":"A. Lempel","year":"1976","unstructured":"A. Lempel and J. Ziv, On the complexity of finite sequences, IEEE Trans. on Inf. Theory 22, 75\u201381 (1976).","journal-title":"IEEE Trans. on Inf. Theory"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"W. Plandowski, Testing equivalence of morphisms on context-free languages, ESA'94, Lecture Notes in Computer Science 855, Springer-Verlag, 460\u2013470 (1994).","DOI":"10.1007\/BFb0049431"},{"key":"34_CR13","volume-title":"Data compression: methods and theory","author":"J. Storer","year":"1988","unstructured":"J. Storer, Data compression: methods and theory, Computer Science Press, Rockville, Maryland, 1988."},{"issue":"3","key":"34_CR14","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"IT-23","author":"J. Ziv","year":"1977","unstructured":"J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Trans. on Inf. Theory vo. IT-23(3), 337\u2013343, 1977.","journal-title":"IEEE Trans. on Inf. Theory vo."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61422-2_148.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:18:36Z","timestamp":1742599116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61422-2_148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614227","9783540685296"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-61422-2_148","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}