The following pages link to Protected points in ordered trees (Q2425405):
Displaying 17 items.
- \(k\)-protected vertices in binary search trees (Q395245) (← links)
- The uplift principle for ordered trees (Q419136) (← links)
- Notes on protected nodes in digital search trees (Q419140) (← links)
- The hitting time subgroup, Łukasiewicz paths and Faber polynomials (Q607369) (← links)
- Protected points in \(k\)-ary trees (Q617014) (← links)
- Asymptotic distribution of two-protected nodes in random binary search trees (Q714563) (← links)
- Protected cells in compositions (Q832725) (← links)
- \(k\)-protected vertices in unlabeled rooted plane trees (Q2014218) (← links)
- Weakly protected points in ordered trees (Q2045373) (← links)
- Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees (Q2363114) (← links)
- Stochastic approximation on noncompact measure spaces and application to measure-valued Pólya processes (Q2657943) (← links)
- Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees (Q2789556) (← links)
- Nonleaf Patterns in Trees: Protected Nodes and Fine Numbers (Q3300679) (← links)
- PICK TWO POINTS IN A TREE (Q5243002) (← links)
- Protected Branches in Ordered Trees (Q5882292) (← links)
- Protection numbers in simply generated trees and Pólya trees (Q6114284) (← links)
- Summations on the diagonals of a Riordan array and some applications (Q6117088) (← links)
