{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T02:39:22Z","timestamp":1781663962255,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540552512","type":"print"},{"value":"9783540467991","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55251-0_2","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:56:01Z","timestamp":1330250161000},"page":"24-48","source":"Crossref","is-referenced-by-count":85,"title":["Varieties of increasing trees"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Bergeron","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philippe","family":"Flajolet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruno","family":"Salvy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"2_CR1","unstructured":"Bali\u0144ska, K. T., Quintas, L. V., and Szymansky, J. Random recursive forests. Preprint, August 1991."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0097-3165(73)90038-1","volume":"15","author":"E. A. Bender","year":"1973","unstructured":"Bender, E. A. Central and local limit theorems applied to asymptotic enumeration. Journal of Combinatorial Theory 15 (1973), 91\u2013111.","journal-title":"Journal of Combinatorial Theory"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bergeron, F., Labelle, G., and Leroux, P. Computation of the expected number of leaves in a tree having a given automorphism, and related topics. preliminary version, 1991.","DOI":"10.1016\/0166-218X(91)90078-B"},{"key":"2_CR4","unstructured":"Burge, W. H. An analysis of a tree sorting method and some properties of a set of trees. In First USA-JAPAN Computer Conference Proceedings (October 1972), AFIPS and IPSJ, pp. 372\u2013378."},{"key":"2_CR5","unstructured":"Chen, W., and Ni, W. Heap ordered trees. Personal communication, October 1991. Based on Wen-Chun Ni's Master Thesis, National Taiwan University."},{"key":"2_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-010-2196-8","volume-title":"Advanced Combinatorics","author":"L. Comtet","year":"1974","unstructured":"Comtet, L.Advanced Combinatorics. Reidel, Dordrecht, 1974."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02915448","volume":"26","author":"L. Devroye","year":"1988","unstructured":"Devroye, L. Applications of the theory of records in the study of random trees. Acta Informatica 26 (1988), 123\u2013130.","journal-title":"Acta Informatica"},{"key":"2_CR8","volume-title":"Analytic Functions","author":"M. A. Evgrafov","year":"1966","unstructured":"Evgrafov, M. A.Analytic Functions. Dover, New York, 1966."},{"key":"2_CR9","unstructured":"Flajolet, P. Random tree models in the analysis of algorithms. In PERFORMANCE'87 (1988), P.-J. Courtois and G. Latouche, Eds., Elsevier Science Publishers (North Holland), pp. 171\u2013187. (Invited lecture)."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Gonnet, G., Puech, C., and Robson, J. M. Analytic variations on quadtrees. Algorithmica (1992). 24 pages, to appear.","DOI":"10.1007\/BF01891833"},{"issue":"2","key":"2_CR11","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0403019","volume":"3","author":"P. Flajolet","year":"1990","unstructured":"Flajolet, P., and Odlyzko, A. M. Singularity analysis of generating functions. SIAM Journal on Discrete Mathematics 3, 2 (1990), 216\u2013240.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0097-3165(90)90056-3","volume":"53","author":"P. Flajolet","year":"1990","unstructured":"Flajolet, P., and Soria, M. Gaussian limiting distributions for the number of components in combinatorial structures. Journal of Combinatorial Theory, Series A 53 (1990), 165\u2013182.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"2_CR13","unstructured":"Flajolet, P., and Soria, M. General combinatorial schemas: Gaussian limit distributions and exponential tails. Discrete Mathematics (1991). To appear in the Special Issue on Combinatorics and Algorithms, A. S. Fraenkel Editor. Available as Research Report 632, LRI, Universit\u00e9 Paris-Sud, January 1991. 21 pages."},{"key":"2_CR14","volume-title":"Studies on divergent series and summability and the asymptotic developments of functions defined by Maclaurin series","author":"W. B. Ford","year":"1960","unstructured":"Ford, W. B.Studies on divergent series and summability and the asymptotic developments of functions defined by Maclaurin series, 3rd ed. Chelsea Publishing Company, New York, 1960.","edition":"3rd ed."},{"issue":"12","key":"2_CR15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1051\/ita\/197610R300351","volume":"10","author":"J. Fran\u00e7on","year":"1976","unstructured":"Fran\u00e7on, J. Arbres binaires de recherche: Propri\u00e9t\u00e9s combinatoires et applications. RAIRO Informatique Th\u00e9orique 10, 12 (Dec. 1976), 35\u201350.","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"2_CR16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1080\/00031305.1977.10479200","volume":"31","author":"J. L. Gastwirth","year":"1977","unstructured":"Gastwirth, J. L. A probability model of a pyramid scheme. American Statistician 31 (1977), 79\u201382.","journal-title":"American Statistician"},{"issue":"3","key":"2_CR17","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/opre.32.3.527","volume":"32","author":"J. L. Gastwirth","year":"1984","unstructured":"Gastwirth, J. L., and Bhattacharya, P. K. Two probability models of pyramid or chain letter schemes demonstrating that their promotional claims are unreliable. Operations Research 32, 3 (May\u2013June 1984), 527\u2013536.","journal-title":"Operations Research"},{"key":"2_CR18","unstructured":"Gonnet, G. H., and Baeza-Yates, R. Handbook of Algorithms and Data Structures: in Pascal and C, second ed. Addison-Wesley, 1991."},{"key":"2_CR19","volume-title":"Combinatorial Enumeration","author":"I. P. Goulden","year":"1983","unstructured":"Goulden, I. P., and Jackson, D. M.Combinatorial Enumeration. John Wiley, New York, 1983."},{"key":"2_CR20","unstructured":"Graham, R., Knuth, D., and Patashnik, O. Concrete Mathematics. Addison Wesley, 1989."},{"issue":"3","key":"2_CR21","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1051\/ita\/1989230303171","volume":"23","author":"P. Hennequin","year":"1989","unstructured":"Hennequin, P. Combinatorial analysis of quicksort algorithm. RAIRO Theoretical Informatics and Applications 23, 3 (1989), 317\u2013333.","journal-title":"RAIRO Theoretical Informatics and Applications"},{"issue":"1","key":"2_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0001-8708(81)90052-9","volume":"42","author":"A. Joyal","year":"1981","unstructured":"Joyal, A. Une th\u00e9orie combinatoire des s\u00e9ries formelles. Advances in Mathematics 42, 1 (1981), 1\u201382.","journal-title":"Advances in Mathematics"},{"key":"2_CR23","unstructured":"Knuth, D. E. The Art of Computer Programming, vol. 1: Fundamental Algorithms. Addison-Wesley, 1968. Second edition, 1973."},{"key":"2_CR24","unstructured":"Knuth, D. E. The Art of Computer Programming, vol. 3: Sorting and Searching. Addison-Wesley, 1973."},{"issue":"2","key":"2_CR25","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1090\/S0002-9939-1989-0949878-9","volume":"105","author":"D. E. Knuth","year":"1989","unstructured":"Knuth, D. E., and Pittel, B. A recurrence related to trees. Proceedings of the American Mathematical Society 105, 2 (Feb. 1989), 335\u2013349.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"2_CR26","unstructured":"Leroux, P., and Viennot, G. X. Combinatorial resolution of systems of differential equations I: Ordinary differential equations. In Combinatoire \u00c9num\u00e9rative (1986), G. Labelle and P. Leroux, Eds., no. 1234 in Lecture Notes in Mathematics, Springer-Verlag, pp. 210\u2013245."},{"key":"2_CR27","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0012-365X(88)90213-0","volume":"72","author":"P. Leroux","year":"1988","unstructured":"Leroux, P., and Viennot, X. G. Combinatorial resolution of systems of differential equations. IV. separation of variables. Discrete Mathematics 72 (1988), 237\u2013250.","journal-title":"Discrete Mathematics"},{"issue":"4","key":"2_CR28","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1051\/ita\/1987210404791","volume":"21","author":"G. Louchard","year":"1987","unstructured":"Louchard, G. Exact and asymptotic distributions in digital and binary search trees. RAIRO Theoretical Informatics and Applications 21, 4 (1987), 479\u2013495.","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"2_CR29","volume-title":"Evolution of Random Search Trees","author":"H. Mahmoud","year":"1991","unstructured":"Mahmoud, H.Evolution of Random Search Trees. John Wiley, New York, 1991. In press."},{"key":"2_CR30","unstructured":"Mahmoud, H. M. Distances in random plane-oriented recursive trees, 1991. Preprint. To appear in the Journal of Applied and Computational Mathematics, special issue on asymptotic analysis in discrete mathematics."},{"key":"2_CR31","unstructured":"Mahmoud, H. M., Smythe, R. T., and Szyma\u0144ski, J. On the structure of random plane-oriented recursive trees and their branches, 1991. Preprint."},{"key":"2_CR32","doi-asserted-by":"crossref","first-page":"997","DOI":"10.4153\/CJM-1978-085-0","volume":"30","author":"A. Meir","year":"1978","unstructured":"Meir, A., and Moon, J. W. On the altitude of nodes in random trees. Canadian Journal of Mathematics 30 (1978), 997\u20131015.","journal-title":"Canadian Journal of Mathematics"},{"key":"2_CR33","first-page":"49","volume":"66","author":"A. Meir","year":"1988","unstructured":"Meir, A., and Moon, J. W. Recursive trees with no nodes of out-degree one. Congressus Numerantium 66 (1988), 49\u201362.","journal-title":"Congressus Numerantium"},{"key":"2_CR34","doi-asserted-by":"crossref","first-page":"675","DOI":"10.2307\/3213526","volume":"19","author":"D. Najock","year":"1982","unstructured":"Najock, D., and Heyde, C. C. On the number of terminal vertices in certain random trees with an application to stemma constructions in philology. Journal of Applied Probability 19 (1982), 675\u2013680.","journal-title":"Journal of Applied Probability"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Stanley, R. P. Enumerative Combinatorics, vol. I. Wadsworth & Brooks\/Cole, 1986.","DOI":"10.1007\/978-1-4615-9763-6"},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Szyma\u0144ski, J. On a non-uniform random recursive tree. In Random Graphs '85, M. Karo\u0144ski and Z. Palka, Eds., vol. 33 of Annals of Discrete Mathematics. North-Holland, 1987, pp. 297\u2013306.","DOI":"10.1016\/S0304-0208(08)73062-7"},{"key":"2_CR37","unstructured":"Titchmarsh, E. C. The Theory of Functions, second ed. Oxford University Press, 1939."},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Vitter, J. S., and Flajolet, P. Analysis of algorithms and data structures. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed., vol. A: Algorithms and Complexity. North Holland, 1990, ch. 9, pp. 431\u2013524.","DOI":"10.1016\/B978-0-444-88071-0.50014-X"},{"issue":"4","key":"2_CR39","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"Vuillemin, J. A unifying look at data structures. Communications of the ACM 23, 4 (Apr. 1980), 229\u2013239.","journal-title":"Communications of the ACM"},{"key":"2_CR40","unstructured":"Wilf, H. S. Generatingfunctionology. Academic Press, 1990."},{"issue":"2190","key":"2_CR41","first-page":"417","volume":"43","author":"R. Wilson","year":"1937","unstructured":"Wilson, R. Functions with dominant singularities of the generalized algebraic-logarithmic type (II): On the order of the Hadamard product. Proceedings of the London Mathematical Society, Series 2 43, 2190 (1937), 417\u2013438.","journal-title":"Proceedings of the London Mathematical Society, Series 2"}],"container-title":["Lecture Notes in Computer Science","CAAP '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55251-0_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T14:24:17Z","timestamp":1713623057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55251-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552512","9783540467991"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/3-540-55251-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]}}}