{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T20:41:26Z","timestamp":1649104886087},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"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":[[2001,7]]},"DOI":"10.1016\/s0020-0190(00)00185-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:14:53Z","timestamp":1027635293000},"page":"147-153","source":"Crossref","is-referenced-by-count":0,"title":["Worst-case analysis of the Iterated Longest Fragment algorithm"],"prefix":"10.1016","volume":"79","author":[{"given":"J\u00f3zsef","family":"B\u00e9k\u00e9si","sequence":"first","affiliation":[]},{"given":"G\u00e1bor","family":"Galambos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0020-0190(00)00185-X_BIB001","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02238290","article-title":"The fractional greedy algorithm for data compression","volume":"56","author":"B\u00e9k\u00e9si","year":"1996","journal-title":"Computing"},{"key":"10.1016\/S0020-0190(00)00185-X_BIB002","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1006\/jagm.1997.0885","article-title":"Greedy algorithms for on-line data compression","volume":"25","author":"B\u00e9k\u00e9si","year":"1997","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(00)00185-X_BIB003","series-title":"New Trends in Mathematical Programming","first-page":"13","article-title":"Longest Fragment First algorithms for data compression","author":"B\u00e9k\u00e9si","year":"1998"},{"key":"10.1016\/S0020-0190(00)00185-X_BIB004","series-title":"Transmission of Information","author":"Fano","year":"1961"},{"issue":"9","key":"10.1016\/S0020-0190(00)00185-X_BIB005","first-page":"1098","article-title":"A method for the construction od minimum-redundancy codes","volume":"40","author":"Huffman","year":"1952","journal-title":"Proc. Institute of Electrical and Radio Engineers"},{"key":"10.1016\/S0020-0190(00)00185-X_BIB006","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/128749.128751","article-title":"An analysis of the longest matching and the greedy heuristic in text encoding","volume":"39","author":"Katajainen","year":"1992","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(00)00185-X_BIB007","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0020-0190(96)00066-X","article-title":"On-line longest fragment first algorithm","volume":"59","author":"Nagumo","year":"1996","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0020-0190(00)00185-X_BIB008","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1147\/rd.232.0149","article-title":"Arithmetic coding","volume":"23","author":"Risassen","year":"1979","journal-title":"IBM J. Res. Development"},{"key":"10.1016\/S0020-0190(00)00185-X_BIB009","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0020-0271(74)90069-2","article-title":"A comparison of algorithms for data base compression by use of fragments as language elements","volume":"10","author":"Schuegraf","year":"1974","journal-title":"Inform. Stor. Ret."},{"key":"10.1016\/S0020-0190(00)00185-X_BIB010","series-title":"Proc. 8th International Parallel Processing Symp.","first-page":"344","article-title":"PRAM algorithms for static dictionary compression","author":"Stauffer","year":"1994"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900000185X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900000185X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T10:57:48Z","timestamp":1555671468000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001900000185X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S002001900000185X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00185-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}