{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:25:41Z","timestamp":1759335941097},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6621,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1016\/0304-3975(94)00308-6","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"221-249","source":"Crossref","is-referenced-by-count":24,"title":["Probabilistic analysis of bucket recursive trees"],"prefix":"10.1016","volume":"144","author":[{"given":"Hosam M.","family":"Mahmoud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert T.","family":"Smythe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00308-6_BIB1","series-title":"Branching Processes","author":"Athreya","year":"1972"},{"key":"10.1016\/0304-3975(94)00308-6_BIB2","doi-asserted-by":"crossref","first-page":"446","DOI":"10.2307\/1426138","article-title":"The first- and last-birth problems for a multitype age-dependent branching process","volume":"8","author":"Biggins","year":"1976","journal-title":"Adv. Appl. Probab."},{"key":"10.1016\/0304-3975(94)00308-6_BIB3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF00265991","article-title":"Branching processes in the analysis of the height of trees","volume":"24","author":"Devroye","year":"1987","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(94)00308-6_BIB4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02915448","article-title":"Applications of the theory of records in the study of random trees","volume":"26","author":"Devroye","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(94)00308-6_BIB5","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1137\/S009753979223023X","article-title":"The joint distribution of elastic buckets in multiway search trees","volume":"23","author":"Lew","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00308-6_BIB6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1017\/S0269964800001881","article-title":"Limiting distributions for path lengths in recursive trees","volume":"5","author":"Mahmoud","year":"1991","journal-title":"Probab. Engg. Inform. Sci."},{"key":"10.1016\/0304-3975(94)00308-6_BIB7","series-title":"Evolution of Random Search Trees","author":"Mahmoud","year":"1992"},{"key":"10.1016\/0304-3975(94)00308-6_BIB8","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/0196-6774(89)90023-0","article-title":"Analysis of the space of search trees under the random insertion algorithm","volume":"10","author":"Mahmoud","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(94)00308-6_BIB9","series-title":"Multitype Branching Processes","author":"Mode","year":"1971"},{"key":"10.1016\/0304-3975(94)00308-6_BIB10","first-page":"125","article-title":"The distance between nodes in recursive trees","volume":"Vol. 13","author":"Moon","year":"1994"},{"key":"10.1016\/0304-3975(94)00308-6_BIB11","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/rsa.3240050207","article-title":"Note on the heights of random recursive trees and random m-ary search trees","volume":"5","author":"Pittel","year":"1994","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/0304-3975(94)00308-6_BIB12","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/0196-6774(85)90003-3","article-title":"The analysis of a fringe heuristic for binary search trees","volume":"6","author":"Poblete","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(94)00308-6_BIB13","series-title":"Asymptotic normality of split times of a class of Markov branching processes: Applications to urn models","author":"Smythe","year":"1994"},{"key":"10.1016\/0304-3975(94)00308-6_BIB14","article-title":"A survey of recursive trees","author":"Smythe","year":"1995","journal-title":"Theory Probab. Math. Statist."},{"key":"10.1016\/0304-3975(94)00308-6_BIB15","series-title":"Enumerative Combinatorics","author":"Stanley","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594003086?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594003086?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:28:02Z","timestamp":1555417682000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594003086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["0304397594003086"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00308-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}