{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:08:30Z","timestamp":1758823710686},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"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":5860,"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":[[1997,7]]},"DOI":"10.1016\/s0304-3975(96)00269-1","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"181-194","source":"Crossref","is-referenced-by-count":5,"title":["On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees"],"prefix":"10.1016","volume":"181","author":[{"given":"Helmut","family":"Prodinger","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00269-1_BIB1","author":"Abramowitz","year":"1970"},{"key":"10.1016\/S0304-3975(96)00269-1_BIB2","series-title":"Graph Theory and Computing","first-page":"15","article-title":"The average height of planted plane trees","author":"de Bruijn","year":"1972"},{"key":"10.1016\/S0304-3975(96)00269-1_BIB3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0020-0190(94)00135-9","article-title":"A note on the Horton-Strahler number for random trees","volume":"52","author":"Devroye","year":"1994","journal-title":"Information Processing Lett."},{"key":"10.1016\/S0304-3975(96)00269-1_BIB4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(79)90009-4","article-title":"The number of registers required for evaluating arithmetic expressions","volume":"9","author":"Flajolet","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00269-1_BIB5","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1137\/0215046","article-title":"Register allocation for unary-binary trees","volume":"15","author":"Flajolet","year":"1986","journal-title":"SIAM J. Computing"},{"key":"10.1016\/S0304-3975(96)00269-1_BIB6","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0403019","article-title":"Singularity analysis of generating functions","volume":"3","author":"Flajolet","year":"1990","journal-title":"SIAM J. Discretes. Math."},{"key":"10.1016\/S0304-3975(96)00269-1_BIB7","unstructured":"P. Flajolet and R. Sedgewick, Analytic Combinatorics (Addison-Wesley, Reading, MA), in preparation."},{"key":"10.1016\/S0304-3975(96)00269-1_BIB8","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF00289094","article-title":"The average number of registers to evaluate a binary tree optimally","volume":"11","author":"Kemp","year":"1979","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(96)00269-1_BIB9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0601005","article-title":"On the order of random channel networks","volume":"1","author":"Meir","year":"1980","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0304-3975(96)00269-1_BIB10","first-page":"118","article-title":"Die Bestimmung gewisser Parameter von bin\u00e4ren B\u00e4umen mit Hilfe analytischer Methoden","volume":"Vol. 1114","author":"Prodinger","year":"1985"},{"key":"10.1016\/S0304-3975(96)00269-1_BIB11","series-title":"Proc. 2nd Conf. Random Graphs","first-page":"241","article-title":"Some recent results on the register function of a binary tree","volume":"33","author":"Prodinger","year":"1987"},{"key":"10.1016\/S0304-3975(96)00269-1_BIB12_1","article-title":"Quelques techniques analytiques pour l'\u00e9tude asymptotique des param\u00e8tres dans les arbres","author":"Prodinger","year":"1983","journal-title":"Lecture Notes for the Summer School in Ile de R\u00e9"},{"key":"10.1016\/S0304-3975(96)00269-1_BIB12_2","first-page":"180","volume":"47","author":"Prodinger","year":"1992","journal-title":"EATCS Bull."},{"key":"10.1016\/S0304-3975(96)00269-1_BIB13","series-title":"Latin '95","first-page":"461","article-title":"Solution of a problem of Yekutieli and Mandelbrot","volume":"Vol. 911","author":"Prodinger","year":"1995"},{"key":"10.1016\/S0304-3975(96)00269-1_BIB14","series-title":"A Course in Modern Analysis","author":"Whittaker","year":"1930"},{"key":"10.1016\/S0304-3975(96)00269-1_BIB15","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1088\/0305-4470\/27\/2\/014","article-title":"Horton-Strahler ordering of random binary trees","volume":"27","author":"Yekutieli","year":"1994","journal-title":"J. Phys. A. Math. Gen."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002691?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002691?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:58:31Z","timestamp":1555419511000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002691"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S0304397596002691"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00269-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}