{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:42:45Z","timestamp":1725486165716},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430025"},{"type":"electronic","value":"9783540452942"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45294-x_8","type":"book-chapter","created":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T22:45:12Z","timestamp":1181601912000},"page":"83-95","source":"Crossref","is-referenced-by-count":0,"title":["Thresholds and Optimal Binary Comparison Search Trees"],"prefix":"10.1007","author":[{"given":"Richard","family":"Anderson","sequence":"first","affiliation":[]},{"given":"Sampath","family":"Kannan","sequence":"additional","affiliation":[]},{"given":"Howard","family":"Karloff","sequence":"additional","affiliation":[]},{"given":"Richard E.","family":"Ladner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,11,26]]},"reference":[{"key":"8_CR1","unstructured":"P.J. Bayer. Improved Bounds on the Cost of Optimaland Balanced Binary Search Trees. M.Sc. Thesis, MIT, MIT\/LCS\/TM-69, 1975."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"C. Chambers and W. Chen. Efficient Multiple and Predicate Dispatching. Proceedings of the 1999 ACM Conference on Object-Oriented Programming Languages, Systems, and Applications (OOPSLA\u2019 99), November, 1999.","DOI":"10.1145\/320384.320407"},{"key":"8_CR3","volume-title":"Information Theory and Reliable Communication","author":"R.G. Gallager","year":"1968","unstructured":"R.G. Gallager. Information Theory and Reliable Communication. Wiley, New York, 1968."},{"key":"8_CR4","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, Vol. 6, pp. 622\u2013242, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/0196-6774(86)90031-3","volume":"7","author":"J.H. Hester","year":"1986","unstructured":"J.H. Hester, D.S. Hirschberg, S.-H.S. Huang, and C.K. Wong. Faster Construction of OptimalBinary Split Trees. Journal of Algorithms, Vol. 7, pp. 412\u2013424, 1986.","journal-title":"Journal of Algorithms"},{"key":"8_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, Vol. 21, pp. 514\u2013532, 1971.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0196-6774(84)90041-5","volume":"5","author":"S.-H.S. Huang","year":"1984","unstructured":"S.-H.S. Huang and C.K. Wong. Optimal Binary Split Trees. Journal of Algorithms, Vol. 5, pp. 69\u201379, 1984.","journal-title":"Journal of Algorithms"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"D.A. Huffman. A Method for the Construction of Minimum Redundancy Codes. Proc. Institute of Radio Engineers, Vol. 40, pp. 1098\u20131101, 1952.","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"8_CR9","volume-title":"Sorting and Searching","author":"D.E. Knuth","year":"1998","unstructured":"D.E. Knuth. The Art of Computer Programming: Volume 3, Second Edition, Sorting and Searching. Addison-Wesley, Reading, Massachusetts, 1998.","edition":"Second Edition"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/0206017","volume":"6","author":"K. Mehlhorn","year":"1977","unstructured":"K. Mehlhorn. A Best Possible Bound for the Weighted Path Length of Binary Search Trees. SIAM Journal on Computing, Vol. 6, pp. 235\u2013239, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0196-6774(84)90017-8","volume":"5","author":"Y. Perl","year":"1984","unstructured":"Y. Perl. Optimum Split Trees. Journal of Algorithms, Vol. 5, pp. 367\u2013374, 1984.","journal-title":"Journal of Algorithms"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1145\/359642.359653","volume":"21","author":"B.A. Sheil","year":"1978","unstructured":"B.A. Sheil. Median Split Trees: A Fast Lookup Technique for Frequently Occurring Keys. Communications of the ACM, Vol. 21, pp. 947\u2013958, 1978.","journal-title":"Communications of the ACM"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/BF01178732","volume":"32","author":"D. Spuler","year":"1994","unstructured":"D. Spuler. Optimal Search Trees Using Two-Way Key Comparisons. Acta Informatica, Vol. 32, pp. 729\u2013740, 1994.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45294-X_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T21:27:52Z","timestamp":1556486872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45294-X_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430025","9783540452942"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45294-x_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}