{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T11:10:20Z","timestamp":1717067420831},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0020-0190(96)00068-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:07:29Z","timestamp":1027609649000},"page":"169-174","source":"Crossref","is-referenced-by-count":18,"title":["On-line versus off-line computation in dynamic text compression"],"prefix":"10.1016","volume":"59","author":[{"given":"Sergio","family":"De Agostino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James A.","family":"Storer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00068-3_BIB1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","article-title":"On the complexity of finite sequences","volume":"22","author":"Lempel","year":"1976","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0020-0190(96)00068-3_BIB2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","article-title":"A universal algorithm for sequential data compression","volume":"23","author":"Lempel","year":"1977","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0020-0190(96)00068-3_BIB3","series-title":"Complexity of Computer Computation","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0020-0190(96)00068-3_BIB4","series-title":"Combinatorial Algorithms on Words","first-page":"131","article-title":"Variations on theme by Ziv-Lempel","author":"Miller","year":"1985"},{"key":"10.1016\/0020-0190(96)00068-3_BIB5","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1006\/inco.1995.1009","article-title":"On encoding and decoding with two-way head machines","volume":"116","author":"Sheinwald","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(96)00068-3_BIB6","series-title":"Data Compression: Methods and Theory","author":"Storer","year":"1988"},{"key":"10.1016\/0020-0190(96)00068-3_BIB7","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/MC.1984.1659158","article-title":"A technique for high-performance data compression","volume":"17","author":"Welch","year":"1984","journal-title":"IEEE Comput."},{"key":"10.1016\/0020-0190(96)00068-3_BIB8","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","article-title":"Compression of individual sequences via variable rate coding","volume":"24","author":"Ziv","year":"1978","journal-title":"IEEE Trans. Information Theory"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000683?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000683?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:54:29Z","timestamp":1556376869000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000683"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0020019096000683"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00068-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}