{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T20:10:27Z","timestamp":1648757427855},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1987,8,1]],"date-time":"1987-08-01T00:00:00Z","timestamp":554774400000},"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":[[1987,8]]},"DOI":"10.1007\/bf00292115","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T16:13:40Z","timestamp":1096992820000},"page":"475-489","source":"Crossref","is-referenced-by-count":0,"title":["Optimal worst case trees"],"prefix":"10.1007","volume":"24","author":[{"given":"Edward A.","family":"Bender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheryl E.","family":"Praeger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas C.","family":"Wormald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","series-title":"Lect. Notes Math.","volume-title":"Regularity and optimality for trees","author":"P. Eades","year":"1981","unstructured":"Eades, P.: Regularity and optimality for trees. Lect. Notes Math. 884. Proc. Eighth Austral. Conf. on Combin. 1980. Berlin, Heidelberg, New York: Springer 1981"},{"key":"CR2","first-page":"213","volume":"14","author":"P. Eades","year":"1982","unstructured":"Eades, P.: Further results on optimal trees. Ars. Comb. 14, 213?224 (1982)","journal-title":"Ars. Comb."},{"key":"CR3","first-page":"37","volume":"12","author":"P. Eades","year":"1981","unstructured":"Eades, P., Jones, L.: A family of optimal trees. Ars. Comb. 12, 37?45 (1981)","journal-title":"Ars. Comb."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/0196-6774(81)90035-3","volume":"2","author":"P. Eades","year":"1981","unstructured":"Eades, P., Staples, J.: On optimal trees. J. Algorithms 2, 369?384 (1981)","journal-title":"J. Algorithms"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/S0019-9958(79)90121-9","volume":"42","author":"F. G\u00f6bel","year":"1979","unstructured":"G\u00f6bel, F., Hoede, C.: On an optimality property of ternary trees. Inf. Control 42, 10?26 (1979)","journal-title":"Inf. Control"},{"key":"CR6","unstructured":"Goldschlager, L.M., Eades, P.D.: Cheapsort. Dept. of Computer Sci. Tech. Rpt. No. 11, Univ. Queensland 1979"},{"key":"CR7","unstructured":"Hyafil, L.: Th\u00e8se de 3\u00e8me cycle. Universit\u00e9 de Paris VI (1974)"},{"key":"CR8","first-page":"216","volume-title":"Proc. Sixth Annual ACM Symp. Comput.","author":"L. Hyafil","year":"1974","unstructured":"Hyafil, L., Prusker, F., Vuillemin, J.: An efficient algorithm for computing optimal disk merge patterns (extended abstract). Proc. Sixth Annual ACM Symp. Comput., pp. 216?229. New York: Assoc. Comput. Mach. 1974"},{"key":"CR9","first-page":"979","volume-title":"Inf. Proc. 74. Proceedings of the IFIP Congress","author":"L. Hyafil","year":"1974","unstructured":"Hyafil, L., Prusker, F., Vuillemin, J.: Design of optimal merge on direct access devices. Inf. Proc. 74. Proceedings of the IFIP Congress, pp. 979?982. Amsterdam: North-Holland 1974"},{"key":"CR10","first-page":"361","volume-title":"The Art of Computer Programming III. Sorting and Searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming III. Sorting and Searching, pp. 361?373. Addison-Wesley, Reading, MA, 1973"},{"key":"CR11","volume-title":"Diophantine Approximations","author":"I. Niven","year":"1963","unstructured":"Niven, I.: Diophantine Approximations. New York: Wiley-Interscience 1963"},{"key":"CR12","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/BFb0022523","volume-title":"Proc. Ninth Symp. on Math. Found, of Comp. Sci. 1980","author":"S. Okoma","year":"1980","unstructured":"Okoma, S.: Generalized Heapsort. Lect. Notes Comput. Sci. 88. Proc. Ninth Symp. on Math. Found, of Comp. Sci. 1980 (P. Dembihski, ed.), pp 439?451. Berlin, Heidelberg, New York: Springer 1980"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00292115.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00292115\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00292115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:16:25Z","timestamp":1554758185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00292115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,8]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,8]]}},"alternative-id":["BF00292115"],"URL":"https:\/\/doi.org\/10.1007\/bf00292115","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,8]]}}}