{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T04:29:27Z","timestamp":1745123367716},"reference-count":41,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"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":6255,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1016\/0012-365x(95)00139-n","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"229-238","source":"Crossref","is-referenced-by-count":6,"title":["Analytic methods in asymptotic enumeration"],"prefix":"10.1016","volume":"153","author":[{"given":"A.M.","family":"Odlyzko","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00139-N_BIB1","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1137\/1016082","article-title":"Asymptotic methods in enumeration","volume":"16","author":"Bender","year":"1974","journal-title":"SIAM Rev."},{"key":"10.1016\/0012-365X(95)00139-N_BIB2","series-title":"Foundations of Applied Combinatorics","author":"Bender","year":"1991"},{"key":"10.1016\/0012-365X(95)00139-N_BIB3","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1214\/aoap\/1177005586","article-title":"The height of a random partial order: concentration of measure","volume":"2","author":"Bollob\u00e1s","year":"1992","journal-title":"Ann. Appl. Probab."},{"key":"10.1016\/0012-365X(95)00139-N_BIB4","series-title":"Asymptotic Methods in Analysis","author":"deBruijn","year":"1958"},{"key":"10.1016\/0012-365X(95)00139-N_BIB5","series-title":"Advanced Combinatorics","author":"Comtet","year":"1974"},{"key":"10.1016\/0012-365X(95)00139-N_BIB6","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1145\/5925.5930","article-title":"A note on the expected height of binary search trees","volume":"33","author":"Devroye","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0012-365X(95)00139-N_BIB7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF00265991","article-title":"Branching processes in the analysis of the heights of trees","volume":"24","author":"Devroye","year":"1987","journal-title":"Acta Inform."},{"key":"10.1016\/0012-365X(95)00139-N_BIB8","series-title":"Integral Representation and the Computation of Combinatorial Sums","author":"Egorychev","year":"1984"},{"key":"10.1016\/0012-365X(95)00139-N_BIB9","series-title":"Asymptotic Expansions","author":"Erd\u00e9lyi","year":"1956"},{"key":"10.1016\/0012-365X(95)00139-N_BIB10","first-page":"83","article-title":"Asymptotic methods in analysis","volume":"I","author":"Fedoryuk","year":"1989"},{"key":"10.1016\/0012-365X(95)00139-N_BIB11","series-title":"Proc. ICALP '92","first-page":"186","article-title":"Analytic analysis of algorithms","volume":"623","author":"Flajolet","year":"1992"},{"key":"10.1016\/0012-365X(95)00139-N_BIB12","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1017\/S0963548300000560","article-title":"The height of binary trees and other simple trees","volume":"2","author":"Flajolet","year":"1993","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/0012-365X(95)00139-N_BIB13","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0022-0000(82)90004-6","article-title":"The average height of binary trees and other simple trees","volume":"25","author":"Flajolet","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0012-365X(95)00139-N_BIB14","first-page":"237","article-title":"Limit distributions for coefficients of iterates of polynomials with application to combinatorial enumeration","volume":"96","author":"Flajolet","year":"1984"},{"key":"10.1016\/0012-365X(95)00139-N_BIB15","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. Discrete Math."},{"key":"10.1016\/0012-365X(95)00139-N_BIB16","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0304-3975(91)90145-R","article-title":"Automatic average-case analysis of algorithms","volume":"79","author":"Flajolet","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0012-365X(95)00139-N_BIB17","author":"Gonnet","year":"1991"},{"key":"10.1016\/0012-365X(95)00139-N_BIB18","series-title":"Combinatorial Enumeration","author":"Goulden","year":"1983"},{"key":"10.1016\/0012-365X(95)00139-N_BIB19","series-title":"Concrete Mathematics","author":"Graham","year":"1989"},{"key":"10.1016\/0012-365X(95)00139-N_BIB20","series-title":"Mathematics for the Analysis of Algorithms","author":"Greene","year":"1982"},{"key":"10.1016\/0012-365X(95)00139-N_BIB21","series-title":"Graphical Enumeration","author":"Harary","year":"1973"},{"key":"10.1016\/0012-365X(95)00139-N_BIB22","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1017\/S1446788700016190","article-title":"Twenty-step algorithm for determining the asymptotic number of trees of various species","volume":"20","author":"Harary","year":"1975","journal-title":"J. Austral. Math. Soc. Ser. A"},{"key":"10.1016\/0012-365X(95)00139-N_BIB23","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1515\/crll.1956.196.67","article-title":"A generalization of Stirling's formula","volume":"196","author":"Hayman","year":"1956","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/0012-365X(95)00139-N_BIB24","series-title":"Probabilistic Analysis of Algorithms","author":"Hofri","year":"1987"},{"key":"10.1016\/0012-365X(95)00139-N_BIB25","series-title":"Fundamentals of the Average Case Analysis of Particular Algorithms","author":"Kemp","year":"1984"},{"key":"10.1016\/0012-365X(95)00139-N_BIB26","unstructured":"A. Knopfmacher, A. Odlyzko, B. Richmond, G. Szekeres and N. Wormald, manuscript, in preparation."},{"key":"10.1016\/0012-365X(95)00139-N_BIB27","author":"Knuth","year":"1973"},{"key":"10.1016\/0012-365X(95)00139-N_BIB28","author":"Knuth","year":"1973"},{"key":"10.1016\/0012-365X(95)00139-N_BIB29","author":"Knuth","year":"1981"},{"key":"10.1016\/0012-365X(95)00139-N_BIB30","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF02128671","article-title":"The asymptotic numbers of regular tournaments, eulerian digraphs, and eulerian and oriented graphs","volume":"10","author":"McKay","year":"1990","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(95)00139-N_BIB31","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/S0195-6698(13)80042-X","article-title":"Asymptotic enumeration by degree sequence of graphs of high degree","volume":"11","author":"McKay","year":"1990","journal-title":"European J. Combin."},{"key":"10.1016\/0012-365X(95)00139-N_BIB32","series-title":"Evolution of Random Search Trees","author":"Mahmoud","year":"1992"},{"key":"10.1016\/0012-365X(95)00139-N_BIB33","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0377-0427(92)90248-V","article-title":"Explicit Tauberian estimates for functions with positive coefficients","volume":"41","author":"Odlyzko","year":"1992","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/0012-365X(95)00139-N_BIB34","first-page":"1063","article-title":"Asymptotic enumeration methods","volume":"Vol. 2","author":"Odlyzko","year":"1995"},{"key":"10.1016\/0012-365X(95)00139-N_BIB35","unstructured":"A.M. Odlyzko, B. Poonen, H. Widom and H.S. Wilf, manuscript, in preparation."},{"key":"10.1016\/0012-365X(95)00139-N_BIB36","series-title":"Introduction to Combinatorial Analysis","author":"Riordan","year":"1958"},{"key":"10.1016\/0012-365X(95)00139-N_BIB37","series-title":"Combinatorial Identities","author":"Riordan","year":"1968"},{"key":"10.1016\/0012-365X(95)00139-N_BIB38","volume":"Vol. 1","author":"Stanley","year":"1986"},{"key":"10.1016\/0012-365X(95)00139-N_BIB39","first-page":"432","article-title":"Analysis of algorithms and data structures","author":"Vitter","year":"1990"},{"key":"10.1016\/0012-365X(95)00139-N_BIB40","series-title":"Generating functionology","author":"Wilf","year":"1990"},{"key":"10.1016\/0012-365X(95)00139-N_BIB41","doi-asserted-by":"crossref","first-page":"534","DOI":"10.4153\/CJM-1959-050-1","article-title":"The asymptotic behavior of the Laurent coefficients","volume":"11","author":"Wyman","year":"1959","journal-title":"Canad. J. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500139N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500139N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,7]],"date-time":"2023-04-07T22:27:13Z","timestamp":1680906433000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500139N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":41,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["0012365X9500139N"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00139-n","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}