{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:50Z","timestamp":1725662930250},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540074076"},{"type":"electronic","value":"9783540379232"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07407-4_4","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:57:51Z","timestamp":1330185471000},"page":"31-41","source":"Crossref","is-referenced-by-count":1,"title":["Best possible bounds on the weighted path length of optimum binary search trees"],"prefix":"10.1007","author":[{"given":"Kurt","family":"Mehlhorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"4_CR1","first-page":"933","volume":"38","author":"E. N. Gilbert","year":"1959","unstructured":"E.N. Gilbert and E.F. Moore: Bell System Techn. Journal 38 (1959), 933\u2013968.","journal-title":"Journal"},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF00289510","volume":"1","author":"T. C. Hu","year":"1972","unstructured":"T.C. Hu and K.C. Tan: Least Upper Bound on the Cost of Optimum Binary Search Trees, Acta Informatica, 1, 307\u2013310 (1972).","journal-title":"Acta Informatica"},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1137\/0121057","volume":"21","author":"T. C. Hu","year":"1971","unstructured":"T.C. Hu and A.C. Tucker: Optimal Computer Search Trees and variable length alphabetic codes, Siam J. Applied Math. 21, 514\u2013532, (1971).","journal-title":"Siam J. Applied Math."},{"key":"4_CR4","unstructured":"T. Kameda and K. Weihrauch: Einf\u00fchrung in die Kodierungstheorie, B I Skripten zur Informatik, Vol. 7."},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"D. E. Knuth","year":"1971","unstructured":"D.E. Knuth: Optimum Binary Search Trees, Acta Informatica, 1, 14\u201325, 1971.","journal-title":"Acta Informatica"},{"key":"4_CR6","unstructured":"D.E. Knuth: The Art of Computer Programming, Vol. 3."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn: Nearly Optimum Binary Search Trees, Preprint, Fachbereich 10, Universit\u00e4t des Saarlandes, 1974.","DOI":"10.1007\/BF00264563"},{"key":"4_CR8","unstructured":"C.P. Schnorr: Two Algorithms for Nearly Optimal Binary Search Trees, Preprint, Fachbereich Mathematik, Universit\u00e4t Frankfurt, 1974."}],"container-title":["Lecture Notes in Computer Science","Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20\u201323, 1975"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07407-4_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:46:27Z","timestamp":1619556387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07407-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540074076","9783540379232"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-07407-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]}}}