References
- [Andrews et al. 99] G. E. Andrews, R. Askey, and R. Roy. Special Functions, Vol. 71 of Encyclopedia of Mathematics and Its Applications. Cambridge: Cambridge University Press, 1999.
- [Chyzak et al. 08] F. Chyzak, M. Drmota, T. Klausner, and G. Kok. “The Distribution of Patterns in Random Trees.” Comb. Probab. Comput. 17(2008), 21–59.
- [Dondajewski and Szymański 82] M. Dondajewski and J. Szymański. “On the Distribution of Vertex-degrees in a Strata of a Random Recursive Tree.” Bulletin de l’Académie Polonaise des Sci. 30(1982), 205–209.
- [Drmota 09] M. Drmota. “The Height of Increasing Trees.” Ann. Comb. 12(2009), 373–402.
- [Elizalde and Noy 03] S. Elizalde and M. Noy. “Consecutive Patterns in Permutations.” Adv. Appl. Math. 30: 1–2 (2003), 110–125. Formal Power Series and Algebraic Combinatorics (Scottsdale, AZ, 2001).
- [Feng and Mahmoud 10] Q. Feng and H. M. Mahmoud. “On the Variety of Shapes on the Fringe of a Random Recursive Tree.” J. Appl. Prob. 47(2010), 191–200.
- [Flajolet and Sedgewick 09] P. Flajolet and R. Sedgewick. Analytic Combinatorics. Cambridge: Cambridge University Press, 2009.
- [Flajolet et al. 97] P. Flajolet, X. Gourdon, and C. Martínez. “Patterns in Random Binary Search Trees.” Random Struct. Algorithms 11(1997), 223–244.
- [Fuchs et al. 06] M. Fuchs, H.-K. Hwang, and R. Neininger. “Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees.” Algorithmica 46: 3–4 (2006), 367–407.
- [Gopaladesikan et al. 14] M. Gopaladesikan, H. Mahmoud, and M. D. Ward. “Asymptotic Joint Normality of Counts of Uncorrelated Motifs in Recursive Trees.” Method. Comput. Appl. Prob.2014. In press.
- [Kravanja and Van Barel 00] P. Kravanja and M. Van Barel. Computing the Zeros of Analytic Functions, Volume 1727 of Lecture Notes in Mathematics. Berlin: Springer-Verlag, 2000.
- [Kuba and Panholzer 08] M. Kuba and A. Panholzer. “Isolating Nodes in Recursive Trees.” Aequationes Mathematicae 76(2008), 258–280.
- [Mahmoud and Smythe 92] H. M. Mahmoud and R. T. Smythe. “Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive Trees.” Random Struct. Algorithms 3(1992), 255–266.
- [Panholzer and Prodinger 04] A. Panholzer and H. Prodinger. “Analysis of Some Statistics for Increasing Tree Families.” Discrete Math. Theor. Comput. Sci. 6(2004), 437–460.
- [Pittel 94] B. Pittel. “Note on the Heights of Random Recursive Trees and Random m-ary Search Trees.” Random Struct. Algorithms 5(1994), 337–347.
- [Smythe and Mahmoud 95] R. T. Smythe and H. Mahmoud. “A Survey of Recursive Trees.” Theory Prob. Math. Stat. 51(1995), 1–27.
- [van der Hofstad et al. 02] R. van der Hofstad, G. Hooghiemstra, and P. Van Mieghem. “On the Covariance of the Level Sizes in Random Recursive Trees.” Random Struct. Algorithms 20(2002), 519–539.