{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T14:51:47Z","timestamp":1672239107066},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":[[1978]]},"DOI":"10.1007\/bf00264321","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T23:30:47Z","timestamp":1096414247000},"page":"273-296","source":"Crossref","is-referenced-by-count":4,"title":["Optimal ?-? trees with capacity constraint"],"prefix":"10.1007","volume":"10","author":[{"given":"D. M.","family":"Choy","sequence":"first","affiliation":[]},{"given":"C. K.","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Informat. 1, 173?189 (1972)","journal-title":"Acta Informat."},{"key":"CR2","unstructured":"Choy, D.M., Wong, C.K.: Optimal ?-? binary trees. IBM Research Report RC5771, December 1975"},{"key":"CR3","first-page":"1","volume":"17","author":"D.M. Choy","year":"1977","unstructured":"Choy, D.M., Wong, C.K.: Bounds for optimal ?-? binary trees. Nordisk Tidskr. Informations-behandling (BIT) 17, 1?15 (1977)","journal-title":"Nordisk Tidskr. Informations-behandling (BIT)"},{"key":"CR4","volume-title":"The art of computer programming, Vol. 1","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The art of computer programming, Vol. 1, 2nd ed. Reading, Mass.: Addison-Wesley 1973","edition":"2nd ed."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264321.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00264321\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264321","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T17:14:47Z","timestamp":1554311687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00264321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978]]}},"alternative-id":["BF00264321"],"URL":"https:\/\/doi.org\/10.1007\/bf00264321","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978]]}}}