{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T01:17:54Z","timestamp":1778807874913,"version":"3.51.4"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","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\/bf00289075","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T16:49:04Z","timestamp":1096908544000},"page":"159-170","source":"Crossref","is-referenced-by-count":151,"title":["On random 2?3 trees"],"prefix":"10.1007","volume":"9","author":[{"given":"Andrew Chi-Chih","family":"Yao","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"The design and analysis of computer algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Reading (Mass.): Addison-Wesley 1974"},{"key":"CR2","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":"CR3","unstructured":"Chvatal, V., Klarner, D.A., Knuth, D.E.: Selected combinatorial research problems. Computer Science Dept., Stanford University, Problem 37, STAN-CS-72-292, 1972"},{"key":"CR4","volume-title":"The art of computer programming, Vol. 1, Fundamental algorithms","author":"D.E. Knuth","year":"1968","unstructured":"Knuth, D.E.: The art of computer programming, Vol. 1, Fundamental algorithms. Reading (Mass.): Addison-Wesley 1968"},{"key":"CR5","volume-title":"The art of computer programming, Vol. 3, 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":"CR6","unstructured":"Yao, A. C.: On random 3-2 trees. Department of Computer Science, University of Illinois, Technical Report (74-679), October 1974"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289075.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289075\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289075","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:14:38Z","timestamp":1554758078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978]]}},"alternative-id":["BF00289075"],"URL":"https:\/\/doi.org\/10.1007\/bf00289075","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978]]}}}