Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. Bóna, M.: k-Protected vertices in binary search trees. Adv. Appl. Math. 53, 1–11 (2014)
2. Bóna, M., Flajolet, P.: Isomorphism and symmetries in random phylogenetic trees. J. Appl. Probab. 46, 1005–1019 (2009)
3. Bona, M., Pittel, B.: On a random search tree: asymptotic enumeration of vertices by distance from leaves. J. Appl. Probab. (to appear)
4. Cheon, G.-S., Shapiro, L.W.: Protected points in ordered trees. Appl. Math. Lett. 21, 516–520 (2008)
5. Devroye, L., Janson, S.: Protected nodes and fringe subtrees in some random trees. Electron. Commun. Probab. 19, 1–10 (2014)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The distribution of the maximum protection number in simply generated trees;Combinatorics, Probability and Computing;2024-04-12
2. Protected Branches in Ordered Trees;Journal of Mathematical Study;2023-06
3. Some refined enumerations of hybrid binary trees;Indian Journal of Pure and Applied Mathematics;2022-11-25
4. On the peel number and the leaf-height of Galton–Watson trees;Combinatorics, Probability and Computing;2022-06-09
5. Protected Cells in Compositions;Mathematics in Computer Science;2021-12-27