Protected points in ordered trees
From MaRDI portal
Publication:2425405
Recommendations
Cites work
Cited in
(25)- \(k\)-protected vertices in unlabeled rooted plane trees
- The hitting time subgroup, Łukasiewicz paths and Faber polynomials
- On the peel number and the leaf-height of Galton–Watson trees
- Weakly protected points in ordered trees
- \(k\)-protected vertices in binary search trees
- Protected cells in compositions
- The uplift principle for ordered trees
- Protected Branches in Ordered Trees
- Degree profile of \(m\)-ary search trees: a vehicle for data structure compression
- Protected cells in bargraphs
- Protection number of recursive trees
- Notes on protected nodes in digital search trees
- Asymptotic distribution of two-protected nodes in random binary search trees
- Stochastic approximation on noncompact measure spaces and application to measure-valued Pólya processes
- Protected vertices in Motzkin trees
- Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees
- Pick two points in a tree
- Summations on the diagonals of a Riordan array and some applications
- Protected points in \(k\)-ary trees
- Protection numbers in simply generated trees and Pólya trees
- Nonleaf patterns in trees: protected nodes and fine numbers
- The distribution of the maximum protection number in simply generated trees
- Protection number in plane trees
- On 2-protected nodes in random digital trees
- Pattern avoidance in parking functions
This page was built for publication: Protected points in ordered trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425405)