{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T05:12:29Z","timestamp":1716959549118},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"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":[[2002,7]]},"DOI":"10.1016\/s0020-0190(01)00316-7","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"63-70","source":"Crossref","is-referenced-by-count":3,"title":["Sending compressed messages to a learned receiver on a bidirectional line"],"prefix":"10.1016","volume":"83","author":[{"given":"Bruno","family":"Carpentieri","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00316-7_BIB001","series-title":"Proc. IEEE Data Compression Conference (DCC 1999)","first-page":"287","article-title":"Data compression using long common strings","author":"Bentley","year":"1999"},{"issue":"1\u20132","key":"10.1016\/S0020-0190(01)00316-7_BIB002","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-0255(01)00097-4","article-title":"Data compression with long repeated strings","volume":"135","author":"Bentley","year":"2001","journal-title":"Inform. Sci."},{"key":"10.1016\/S0020-0190(01)00316-7_BIB003","series-title":"Proc. 25th Ann. Symp. Foundations Computer Science","first-page":"100","article-title":"Interactive data compression","author":"El Gamal","year":"1984"},{"key":"10.1016\/S0020-0190(01)00316-7_BIB004","series-title":"Proc. IEEE Data Compression Conference (DCC 2001)","first-page":"233","article-title":"Software compression in the client\/server environment","author":"Factor","year":"2001"},{"issue":"1\u20132","key":"10.1016\/S0020-0190(01)00316-7_BIB005","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0020-0255(01)00099-8","article-title":"Compression in the presence of shared data","volume":"135","author":"Factor","year":"2001","journal-title":"Inform. Sci."},{"issue":"2","key":"10.1016\/S0020-0190(01)00316-7_BIB006","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","article-title":"Efficient randomized pattern-matching algorithms","volume":"31","author":"Karp","year":"1987","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0020-0190(01)00316-7_BIB007","series-title":"Data Compression: Methods and Theory","author":"Storer","year":"1988"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003167?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003167?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:22:49Z","timestamp":1556882569000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001003167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0020019001003167"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00316-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}