{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T14:54:45Z","timestamp":1672239285424},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1979,6,1]],"date-time":"1979-06-01T00:00:00Z","timestamp":297043200000},"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":[[1979,6]]},"DOI":"10.1007\/bf00264017","type":"journal-article","created":{"date-parts":[[2006,2,23]],"date-time":"2006-02-23T05:38:38Z","timestamp":1140673118000},"page":"63-72","source":"Crossref","is-referenced-by-count":6,"title":["On the max-entropy rule for a binary search tree"],"prefix":"10.1007","volume":"12","author":[{"given":"Yasuichi","family":"Horibe","sequence":"first","affiliation":[]},{"given":"Tibor O. H.","family":"Nemetz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF00264017_CR1","doi-asserted-by":"crossref","unstructured":"G\u00fcttler, R., Mehlhorn, K., Schneider, W.: Binary Search Trees: Average and Worst Case Behavior, submitted to Acta Informatica. (a preliminary version appeared in Informatik-Fachberichte vol. 5, 301\u2013317, Springer-Verlag, 1976)","DOI":"10.1007\/978-3-642-95289-0_22"},{"key":"BF00264017_CR2","unstructured":"Horibe, Y.: Entropy and Balance in Binary Trees, Colloque International du C.N.R.S. held at E.N.S.E.T., Cachan, France, July 1977"},{"key":"BF00264017_CR3","unstructured":"Knuth, D.: Fundamental Algorithms. (The Art of Computer Programming vol. 1), Addison-Wesley, 1968"},{"key":"BF00264017_CR4","unstructured":"Knuth, D.: Sorting and Searching. (The Art of Computer Programming vol. 3), Addison-Wesley, 1973"},{"key":"BF00264017_CR5","unstructured":"Mehlhorn, K.: Private communication (to Y. Horibe)"},{"key":"BF00264017_CR6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00264563","volume":"5","author":"K. Mehlhorn","year":"1975","unstructured":"Mehlhorn, K.: Nearly optimal binary search trees, Acta Informatica 5, 287\u2013295 (1975)","journal-title":"Acta Informatica"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264017.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00264017\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T02:05:29Z","timestamp":1555466729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00264017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,6]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,6]]}},"alternative-id":["BF00264017"],"URL":"https:\/\/doi.org\/10.1007\/bf00264017","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,6]]}}}