{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T03:19:07Z","timestamp":1648955947991},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf01931282","type":"journal-article","created":{"date-parts":[[2005,7,30]],"date-time":"2005-07-30T20:17:25Z","timestamp":1122754645000},"page":"220-229","source":"Crossref","is-referenced-by-count":0,"title":["A note on optimal multiway split trees"],"prefix":"10.1007","volume":"31","author":[{"given":"L. T.","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gen-Huey","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue-Li","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"BF01931282_CR1","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1137\/0210031","volume":"10","author":"L. Gotlieb","year":"1981","unstructured":"L. Gotlieb,Optimal multiway search trees, SIAM Journal on Computing, vol. 10, no. 3, (1981), 422\u2013433.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"BF01931282_CR2","doi-asserted-by":"crossref","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 binary split trees, Journal of Algorithms, vol. 7, no. 3, (1986), 412\u2013424.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"BF01931282_CR3","doi-asserted-by":"crossref","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, no. 1, (1984), 69\u201379.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"BF01931282_CR4","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0196-6774(87)90034-4","volume":"8","author":"S.-H. S. Huang","year":"1987","unstructured":"S.-H. S. Huang,Optimal multiway split trees, Journal of Algorithms, vol. 8, no. 1 (1987), 146\u2013156.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"BF01931282_CR5","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"D. E. Knuth","year":"1971","unstructured":"D. E. Knuth,Optimal binary search trees, Acta Informatica, vol. 1, no. 1, (1971), 14\u201325.","journal-title":"Acta Informatica"},{"issue":"3","key":"BF01931282_CR6","doi-asserted-by":"crossref","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, no. 3, (1984), 367\u2013374.","journal-title":"Journal of Algorithms"},{"issue":"11","key":"BF01931282_CR7","doi-asserted-by":"crossref","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, no. 11, (1978), 947\u2013958.","journal-title":"Communications of the ACM"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01931282.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01931282\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01931282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T00:55:17Z","timestamp":1557449717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01931282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01931282"],"URL":"https:\/\/doi.org\/10.1007\/bf01931282","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}