{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T11:08:35Z","timestamp":1744888115668},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615767"},{"type":"electronic","value":"9783540706274"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61576-8_86","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:58:02Z","timestamp":1330293482000},"page":"234-243","source":"Crossref","is-referenced-by-count":4,"title":["Optimum alphabetic binary trees"],"prefix":"10.1007","author":[{"given":"T. C.","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. D.","family":"Morgenthaler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"10","key":"20_CR1","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1002\/spe.4380211009","volume":"21","author":"A. Andersson","year":"1991","unstructured":"Arne Andersson. A note on searching in a binary search tree. Software-Practice and Experience, 21(10):1125\u20131128, 1991.","journal-title":"Software-Practice and Experience"},{"issue":"4","key":"20_CR2","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1137\/0206045","volume":"6","author":"A. M. Garsia","year":"1977","unstructured":"A. M. Garsia and M. L. Wachs. A new algorithm for minimum cost binary trees. SIAM Journal on Computing, 6(4):622\u2013642, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","volume":"38","author":"E. N. Gilbert","year":"1959","unstructured":"E. N. Gilbert and E. F. Moore. Variable length binary encodings. Bell System Technical Journal, 38:933\u2013968, 1959.","journal-title":"Bell System Technical Journal"},{"key":"20_CR4","volume-title":"Combinatorial Algorithms","author":"T. C. Hu","year":"1982","unstructured":"T. C. Hu. Combinatorial Algorithms. Addison-Wesley, Reading, MA, 1982."},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1137\/0137015","volume":"37","author":"T. C. Hu","year":"1979","unstructured":"T. C. Hu, D. J. Kleitman, and J. K. Tamaki. Binary trees optimum under various criteria. SIAM Journal on Applied Mathematics, 37(2):246\u2013256, 1979.","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"4","key":"20_CR6","doi-asserted-by":"publisher","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 Journal on Applied Mathematics, 21(4):514\u2013532, 1971.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D. A. Huffman","year":"1952","unstructured":"D. A. Huffman. A method for the construction of minimum redundancy codes. Proceedings of the IRE, 40:1098\u20131101, 1952.","journal-title":"Proceedings of the IRE"},{"key":"20_CR8","unstructured":"M. M. Klawe and B. Mumey. Upper and lower bounds on constructing alphabetic binary trees. In Proceedings of Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 185\u2013193, 1993."},{"key":"20_CR9","doi-asserted-by":"publisher","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":"20_CR10","volume-title":"The Art of Computer Programming, Volume III: Sorting and Searching","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth. The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, Reading, MA, 1973."},{"issue":"4","key":"20_CR11","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/0196-6774(87)90052-6","volume":"8","author":"L. L. Larmore","year":"1987","unstructured":"L. L. Larmore. A subquadratic algorithm for constructing approximately optimal binary search trees. Journal of Algorithms, 8(4):579\u2013591, 1987.","journal-title":"Journal of Algorithms"},{"issue":"6","key":"20_CR12","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1137\/0216070","volume":"16","author":"L. L. Larmore","year":"1987","unstructured":"L. L. Larmore. Height restricted optimal binary trees. SIAM Journal on Computing, 16(6):1115\u20131123, 1987.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"20_CR13","first-page":"312","volume":"34","author":"N. Nakatsu","year":"1993","unstructured":"N. Nakatsu. An alphabetic code and its application to information retrieval. Transactions of the Information Processing Society of Japan, 34(2):312\u201319, 1993.","journal-title":"Transactions of the Information Processing Society of Japan"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"T.M. Przytycka and L.L. Larmore. The optimal alphabetic tree problem revisited. In Proceedings of 21st International Colloquium on Automata, Languages, and Programming, pages 251\u2013262. Springer-Verlag, July 1994.","DOI":"10.1007\/3-540-58201-0_73"},{"issue":"2","key":"20_CR15","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(92)90334-C","volume":"93","author":"P. Ramanan","year":"1992","unstructured":"P. Ramanan. Testing the optimality of alphabetic trees. Theoretical Computer Science, 93(2):279\u2013301, 1992.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Combinatorics and Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61576-8_86.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:34:35Z","timestamp":1619573675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61576-8_86"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615767","9783540706274"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-61576-8_86","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}