{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:45:38Z","timestamp":1761291938357},"reference-count":5,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1995,2,1]],"date-time":"1995-02-01T00:00:00Z","timestamp":791596800000},"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":[[1995,2]]},"DOI":"10.1016\/0020-0190(94)00193-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:04:31Z","timestamp":1027649071000},"page":"201-207","source":"Crossref","is-referenced-by-count":6,"title":["Characteristic inequalities for binary trees"],"prefix":"10.1016","volume":"53","author":[{"given":"Roberto","family":"De Prisc","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Persiano","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00193-3_BIB1","series-title":"Information Theory and Reliable Communications","author":"Gallager","year":"1968"},{"issue":"3","key":"10.1016\/0020-0190(94)00193-3_BIB2","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1109\/18.79913","article-title":"Alphabetic codes revisited","volume":"37","author":"Yeung","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"10.1016\/0020-0190(94)00193-3_BIB3","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1145\/322290.322305","article-title":"The complexity of maintaining an array and computing its partial sums","volume":"29","author":"Fredman","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(94)00193-3_BIB4","series-title":"Proc. IEEE Symp. on Foundations of Computer Science","first-page":"480","article-title":"Optimal bi-weighted binary trees and the complexity of maintaining partial sums","author":"Hampaparum","year":"1993"},{"issue":"4","key":"10.1016\/0020-0190(94)00193-3_BIB5","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."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001933?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001933?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T02:58:10Z","timestamp":1555297090000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094001933"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,2]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,2]]}},"alternative-id":["0020019094001933"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00193-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,2]]}}}