{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T14:45:19Z","timestamp":1754145919026,"version":"3.41.2"},"reference-count":9,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[1980,9,1]],"date-time":"1980-09-01T00:00:00Z","timestamp":336614400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1980,9,1]],"date-time":"1980-09-01T00:00:00Z","timestamp":336614400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1980,9,1]],"date-time":"1980-09-01T00:00:00Z","timestamp":336614400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1980,9]]},"DOI":"10.1109\/tit.1980.1056250","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T09:44:54Z","timestamp":1083059094000},"page":"513-517","source":"Crossref","is-referenced-by-count":15,"title":["An efficient algorithm for constructing nearly optimal prefix codes"],"prefix":"10.1109","volume":"26","author":[{"given":"K.","family":"Mehlhorn","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/322203.322205"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(69)90084-9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"journal-title":"Characterization and Design of Optimal Prefix Codes","year":"1977","author":"cot","key":"ref5"},{"journal-title":"Improved bounds on the cost of optimal and balanced binary search trees","year":"0","author":"bayer","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(62)90183-3"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1961.1057615"},{"key":"ref8a","first-page":"301","article-title":"Binary search trees: Average and worst case behavior","volume":"5","author":"g\ufffdttler","year":"0","journal-title":"GI-Jahrestagung 1976"},{"journal-title":"Elecktronische Informationsverarbeituug und Kybernetik","year":"0","key":"ref8b"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22716\/01056250.pdf?arnumber=1056250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T17:58:22Z","timestamp":1752775102000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056250\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,9]]},"references-count":9,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.1980.1056250","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1980,9]]}}}