{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T08:03:14Z","timestamp":1787385794482,"version":"build-2736575974"},"reference-count":9,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"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":[[1993,4]]},"DOI":"10.1016\/0020-0190(93)90212-r","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"249-253","source":"Crossref","is-referenced-by-count":15,"title":["On binary search trees"],"prefix":"10.1016","volume":"45","author":[{"given":"Roberto","family":"De Prisco","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfredo","family":"De Santis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90212-R_BIB1","series-title":"Search Problems","author":"Ahlswede","year":"1987"},{"key":"10.1016\/0020-0190(93)90212-R_BIB2","series-title":"Combinatorial Search","author":"Aigner","year":"1988"},{"key":"10.1016\/0020-0190(93)90212-R_BIB3","series-title":"M.Sc. Thesis","article-title":"Improved bounds on the cost of optimal and balanced binary search trees","author":"Bayer","year":"1975"},{"key":"10.1016\/0020-0190(93)90212-R_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 System Tech. J."},{"key":"10.1016\/0020-0190(93)90212-R_BIB5","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1137\/0121057","article-title":"Optimum computer search trees and variable-length alphabetical codes","volume":"21","author":"Hu","year":"1971","journal-title":"SIAM J. Applied Math."},{"key":"10.1016\/0020-0190(93)90212-R_BIB6","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(93)90212-R_BIB7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00264563","article-title":"Nearly optimal binary search trees","volume":"5","author":"Mehlhorn","year":"1975","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(93)90212-R_BIB8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1137\/0206017","article-title":"A best possible bound for the weighted path length of binary search trees","volume":"2","author":"Mehlhorn","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(93)90212-R_BIB9","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"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390212R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390212R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:26:37Z","timestamp":1555129597000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390212R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["002001909390212R"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90212-r","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}