Pages that link to "Item:Q714563"
From MaRDI portal
The following pages link to Asymptotic distribution of two-protected nodes in random binary search trees (Q714563):
Displaying 11 items.
- \(k\)-protected vertices in binary search trees (Q395245) (← links)
- Central limit theorems for additive functionals and fringe trees in tries (Q2136104) (← links)
- Limiting probabilities for vertices of a given rank in 1-2 trees (Q2323818) (← links)
- Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees (Q2363114) (← links)
- Mean and variance of balanced Pólya urns (Q5005047) (← links)
- Weakly protected nodes in random binary search trees (Q5037204) (← links)
- On a random search tree: asymptotic enumeration of vertices by distance from leaves (Q5233192) (← links)
- DEGREE PROFILE OF <i>m</i>-ARY SEARCH TREES: A VEHICLE FOR DATA STRUCTURE COMPRESSION (Q5358070) (← links)
- On the peel number and the leaf-height of Galton–Watson trees (Q5885185) (← links)
- On 2-protected nodes in random digital trees (Q5964078) (← links)
- Protection numbers in simply generated trees and Pólya trees (Q6114284) (← links)
