{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T05:41:34Z","timestamp":1673502094915},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1984,5,1]],"date-time":"1984-05-01T00:00:00Z","timestamp":452217600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1984,5]]},"DOI":"10.1007\/bf00289139","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T17:07:11Z","timestamp":1096909631000},"page":"47-60","source":"Crossref","is-referenced-by-count":6,"title":["Optimal multiway search trees for variable size keys"],"prefix":"10.1007","volume":"21","author":[{"given":"Jayme","family":"Luiz Szwarcfiter","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1971","unstructured":"Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Informat. 1, 173?189 (1971)","journal-title":"Acta Informat."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1137\/0203008","volume":"2","author":"M.R. Garey","year":"1974","unstructured":"Garey, M.R.: Optimal binary search trees with restricted maximal depth. SIAM J. Comput. 2, 101?110 (1974)","journal-title":"SIAM J. Comput."},{"key":"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":"Gilbert, E.N., Moore, E.F.: Variable-length binary encodings. Bell System Tech. J. 38, 933?968 (1959)","journal-title":"Bell System Tech. J."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1137\/0210031","volume":"10","author":"L. Gotlieb","year":"1981","unstructured":"Gotlieb, L.: Optimal multiway search trees. SIAM J. Comput. 10, 422?433 (1981)","journal-title":"SIAM J. Comput."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1080\/00207168108803225","volume":"A9","author":"L. Gotlieb","year":"1981","unstructured":"Gotlieb, L., Wood, D.: The construction of optimal multiway search trees and the monotonicity principles. Internat. J. Comput. Math. Sc. A9, 17?24 (1981)","journal-title":"Internat. J. Comput. Math. Sc."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00288968","volume":"17","author":"S. Huddleston","year":"1982","unstructured":"Huddleston, S., Mehlhorn, K.: A new data structure for representing sorted lists: Acta Informat. 17, 157?184 (1982)","journal-title":"Acta Informat."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1137\/0205002","volume":"5","author":"A. Itai","year":"1976","unstructured":"Itai, A.: Optimal alphabetic trees. SIAM J. Comput. 5, 9?18 (1976)","journal-title":"SIAM J. Comput."},{"key":"CR8","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations. Miller, R.E., Thatcher, J.W. (eds.) New York: Plenum Press 1972"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"D.E. Knuth","year":"1971","unstructured":"Knuth, D.E.: Optimum binary search trees. Acta Informat. 1, 14?25 (1971)","journal-title":"Acta Informat."},{"key":"CR10","volume-title":"Sorting and searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, Vol. 3: Sorting and searching. Reading (Mass.): Addison-Wesley 1973"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1145\/359810.359839","volume":"20","author":"E.M. McCreight","year":"1977","unstructured":"McCreight, E.M.: Pagination of B*-trees with variable length records. Comm. ACM 20, 670?674 (1977)","journal-title":"Comm. ACM"},{"key":"CR12","doi-asserted-by":"crossref","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 Informat. 14, 119?133 (1980)","journal-title":"Acta Informat."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289139.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289139\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289139","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:14:41Z","timestamp":1554743681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,5]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,5]]}},"alternative-id":["BF00289139"],"URL":"https:\/\/doi.org\/10.1007\/bf00289139","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,5]]}}}