{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:33:06Z","timestamp":1725535986978},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033667"},{"type":"electronic","value":"9783642033674"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03367-4_21","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T03:56:42Z","timestamp":1248062202000},"page":"230-241","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Construction of Near-Optimal Binary and Multiway Search Trees"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Karim","family":"Dou\u00efeb","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indexes. Acta Informatica\u00a01(3), 173\u2013189 (1972)","journal-title":"Acta Informatica"},{"key":"21_CR2","first-page":"389","volume":"1","author":"P. Becker","year":"1994","unstructured":"Becker, P.: A new algorithm for the construction of optimal B-trees. Nordic Journal of Computing\u00a01, 389\u2013401 (1994)","journal-title":"Nordic Journal of Computing"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/BFb0045096","volume-title":"Computing and Combinatorics","author":"P. Becker","year":"1997","unstructured":"Becker, P.: Construction of nearly optimal multiway trees. In: Jiang, T., Lee, D.T. (eds.) COCOON 1997. LNCS, vol.\u00a01276, pp. 294\u2013303. Springer, Heidelberg (1997)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Bent, S., Sleator, D., Tarjan, R.: Biased 2-3 trees. In: Annual Symposium on Foundations of Computer Science, pp. 248\u2013254 (1980)","DOI":"10.1109\/SFCS.1980.15"},{"issue":"3","key":"21_CR5","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0214041","volume":"14","author":"S. Bent","year":"1985","unstructured":"Bent, S., Sleator, D., Tarjan, R.: Biased search trees. SIAM J. Comput.\u00a014(3), 545\u2013568 (1985)","journal-title":"SIAM J. Comput."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"3139","DOI":"10.1002\/j.1538-7305.1983.tb03469.x","volume":"62","author":"J. Feigenbaum","year":"1983","unstructured":"Feigenbaum, J., Tarjan, R.: Two new kinds of biased search trees. Bell Syst. Tech. J.\u00a062, 3139\u20133158 (1983)","journal-title":"Bell Syst. Tech. J."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1137\/0206045","volume":"6","author":"A.M. Garsia","year":"1977","unstructured":"Garsia, A.M., Wachs, M.L.: A new algorithm for minimum cost binary trees. SIAM Journal on Computing\u00a06, 622\u2013642 (1977)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1137\/0210031","volume":"10","author":"L. Gotlieb","year":"1981","unstructured":"Gotlieb, L.: Optimal multi-way search trees. SIAM Journal of Computing\u00a010(3), 422\u2013433 (1981)","journal-title":"SIAM Journal of Computing"},{"issue":"4","key":"21_CR9","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/0121057","volume":"21","author":"T.C. Hu","year":"1971","unstructured":"Hu, T.C., Tucker, A.C.: Optimal computer search trees and variable-length alphabetical codes. SIAM Journal on Applied Mathematics\u00a021(4), 514\u2013532 (1971)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"21_CR10","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"Knuth, D.: The Art of Computer Programming: Sorting and Searching, vol.\u00a03. Addison-Wesley, Reading (1973)"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF00289517","volume":"1","author":"D. Knuth","year":"1971","unstructured":"Knuth, D.: Optimum binary search trees. Acta Informatica\u00a01, 79\u2013110 (1971)","journal-title":"Acta Informatica"},{"key":"21_CR12","series-title":"EATCS Monographs on Theoretical Computer Science","volume-title":"Data structures and algorithms: Sorting und Searching","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data structures and algorithms: Sorting und Searching. EATCS Monographs on Theoretical Computer Science, vol.\u00a01. Springer, Berlin (1984)"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF00264563","volume":"5","author":"K. Mehlhorn","year":"1975","unstructured":"Mehlhorn, K.: Nearly optimal binary search trees. Acta Inf.\u00a05, 287\u2013295 (1975)","journal-title":"Acta Inf."},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/0206017","volume":"6","author":"K. Mehlhorn","year":"1977","unstructured":"Mehlhorn, K.: A best possible bound for the weighted path length of binary search trees. SIAM Journal on Computing\u00a06, 235\u2013239 (1977)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"21_CR15","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(93)90212-R","volume":"45","author":"R.D. Prisco","year":"1993","unstructured":"Prisco, R.D., Santis, A.D.: On binary search trees. Information Processing Letters\u00a045(5), 249\u2013253 (1993)","journal-title":"Information Processing Letters"},{"issue":"1&2","key":"21_CR16","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(95)00153-0","volume":"156","author":"R.D. Prisco","year":"1996","unstructured":"Prisco, R.D., Santis, A.D.: New lower bounds on the cost of binary search trees. Theor. Comput. Sci.\u00a0156(1&2), 315\u2013325 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C. Shannon","year":"1948","unstructured":"Shannon, C.: A mathematical theory of communication. Bell System Technical Journal\u00a027, 379\u2013423, 623\u2013656 (1948)","journal-title":"Bell System Technical Journal"},{"issue":"2","key":"21_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF00288540","volume":"14","author":"V.K. Vaishnavi","year":"1980","unstructured":"Vaishnavi, V.K., Kriegel, H.P., Wood, D.: Optimum multiway search trees. Acta Informatica\u00a014(2), 119\u2013133 (1980)","journal-title":"Acta Informatica"},{"issue":"3","key":"21_CR19","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 Transactions on Information Theory\u00a037(3), 564\u2013572 (1991)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03367-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T01:35:35Z","timestamp":1552095335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}