{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T06:00:10Z","timestamp":1648620010239},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":[[1998,4]]},"DOI":"10.1016\/s0020-0190(98)00026-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"35-40","source":"Crossref","is-referenced-by-count":0,"title":["Optimum extensions of prefix codes"],"prefix":"10.1016","volume":"66","author":[{"given":"Ion I.","family":"M\u0103ndoiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00026-X_BIB1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01840359","article-title":"Geometric applications of a matrix-searching algorithm","volume":"2","author":"Aggarwal","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(98)00026-X_BIB2","article-title":"Optimum extendable prefix codes","author":"Calude","year":"1995"},{"key":"10.1016\/S0020-0190(98)00026-X_BIB3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1137\/0203008","article-title":"Optimal binary search trees with restricted maximal depth","volume":"3","author":"Garey","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(98)00026-X_BIB4","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","article-title":"Variable-length binary encodings","volume":"38","author":"Gilbert","year":"1959","journal-title":"Bell Systems Tech. J."},{"key":"10.1016\/S0020-0190(98)00026-X_BIB5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1080\/00207168108803225","article-title":"The construction of optimal multiway search trees and the monotonicity principle","volume":"A 9","author":"Gotlieb","year":"1981","journal-title":"Internat. J. Comput. Math. Sec."},{"key":"10.1016\/S0020-0190(98)00026-X_BIB6","first-page":"1098","article-title":"A method for the construction of minimum redundancy codes","volume":"40","author":"Huffman","year":"1952"},{"key":"10.1016\/S0020-0190(98)00026-X_BIB7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1137\/0205002","article-title":"Optimal alphabetic trees","volume":"5","author":"Itai","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(98)00026-X_BIB8","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF00264289","article-title":"Optimum binary search trees","volume":"1","author":"Knuth","year":"1971","journal-title":"Acta Inform."},{"key":"10.1016\/S0020-0190(98)00026-X_BIB9","volume":"Vol. 1","author":"Knuth","year":"1973"},{"key":"10.1016\/S0020-0190(98)00026-X_BIB10","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1137\/0216070","article-title":"Height restricted optimal binary trees","volume":"16","author":"Larmore","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(98)00026-X_BIB11","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1145\/363958.363991","article-title":"Generating a canonical prefix encoding","volume":"7","author":"Schwartz","year":"1964","journal-title":"Comm. ACM"},{"issue":"4","key":"10.1016\/S0020-0190(98)00026-X_BIB12","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0020-0190(76)90052-1","article-title":"Optimal alphabetic search trees with restricted maximal height","volume":"4","author":"Wessner","year":"1976","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909800026X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909800026X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:27:34Z","timestamp":1556058454000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001909800026X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S002001909800026X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00026-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}