{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:49:14Z","timestamp":1764557354788},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489703"},{"type":"electronic","value":"9783662489710"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48971-0_7","type":"book-chapter","created":{"date-parts":[[2015,11,25]],"date-time":"2015-11-25T23:00:57Z","timestamp":1448492457000},"page":"71-82","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Search Trees with 2-Way Comparisons"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mordecai","family":"Golin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Ian","family":"Munro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neal E.","family":"Young","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0196-6774(02)00203-1","volume":"44","author":"R Anderson","year":"2002","unstructured":"Anderson, R., Kannan, S., Karloff, H., Ladner, R.E.: Thresholds and optimal binary comparison search trees. J. Algorithms 44, 338\u2013358 (2002)","journal-title":"J. Algorithms"},{"key":"7_CR2","unstructured":"Chrobak, M., Golin, M., Munro, J.I., Young, N.E.: Optimal search trees with 2-way comparisons. CoRR, \n                      arXiv:1505.00357v4\n                      \n                     [cs.DS] (2015). \n                      http:\/\/arxiv.org\/abs\/1505.00357v4"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/357084.357092","volume":"2","author":"D Comer","year":"1980","unstructured":"Comer, D.: A note on median split trees. ACM Trans. Program. Lang. Syst. 2(1), 129\u2013133 (1980)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1137\/0206045","volume":"6","author":"AM Garsia","year":"1977","unstructured":"Garsia, A.M., Wachs, M.L.: A new algorithm for minimum cost binary trees. SIAM J. Comput. 6(4), 622\u2013642 (1977)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"7_CR5","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","volume":"38","author":"E Gilbert","year":"1959","unstructured":"Gilbert, E., Moore, E.: Variable-length binary encodings. Bell Syst. Tech. J. 38(4), 933\u2013967 (1959)","journal-title":"Bell Syst. Tech. J."},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/0196-6774(86)90031-3","volume":"7","author":"JH Hester","year":"1986","unstructured":"Hester, J.H., Hirschberg, D.S., Huang, S.H., Wong, C.K.: Faster construction of optimal binary split trees. J. Algorithms 7(3), 412\u2013424 (1986)","journal-title":"J. Algorithms"},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/0121057","volume":"21","author":"TC Hu","year":"1971","unstructured":"Hu, T.C., Tucker, A.C.: Optimal computer search trees and variable-length alphabetical codes. SIAM J. Appl. Math. 21(4), 514\u2013532 (1971)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0196-6774(84)90041-5","volume":"5","author":"S Huang","year":"1984","unstructured":"Huang, S., Wong, C.: Optimal binary split trees. J. Algorithms 5(1), 69\u201379 (1984)","journal-title":"J. Algorithms"},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00289143","volume":"21","author":"S-H Huang","year":"1984","unstructured":"Huang, S.-H., Wong, C.K.: Generalized binary split trees. Acta Inform. 21(1), 113\u2013123 (1984)","journal-title":"Acta Inform."},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"DE Knuth","year":"1971","unstructured":"Knuth, D.E.: Optimum binary search trees. Acta Inform. 1(1), 14\u201325 (1971)","journal-title":"Acta Inform."},{"key":"7_CR11","series-title":"Sorting and Searching","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol. 3, 2nd edn. Addison-Wesley Publishing Company, Reading (1998)","edition":"2"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0196-6774(84)90017-8","volume":"5","author":"Y Perl","year":"1984","unstructured":"Perl, Y.: Optimum split trees. J. Algorithms 5, 367\u2013374 (1984)","journal-title":"J. Algorithms"},{"issue":"11","key":"7_CR13","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1145\/359642.359653","volume":"21","author":"BA Sheil","year":"1978","unstructured":"Sheil, B.A.: Median split trees: a fast lookup technique for frequently occuring keys. Commun. ACM 21(11), 947\u2013958 (1978)","journal-title":"Commun. ACM"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/BF01178732","volume":"740","author":"D Spuler","year":"1994","unstructured":"Spuler, D.: Optimal search trees using two-way key comparisons. Acta Inform. 740, 729\u2013740 (1994)","journal-title":"Acta Inform."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Spuler, D.A.: Optimal search trees using two-way key comparisons. Ph.D. thesis, James Cook University (1994)","DOI":"10.1007\/BF01178732"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/18.79913","volume":"37","author":"R Yeung","year":"1991","unstructured":"Yeung, R.: Alphabetic codes revisited. IEEE Trans. Inf. Theory 37(3), 564\u2013572 (1991)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48971-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T14:02:52Z","timestamp":1559311372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48971-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489703","9783662489710"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48971-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}