Pages that link to "Item:Q3310623"
From MaRDI portal
The following pages link to On the Most Probable Shape of a Search Tree Grown from a Random Permutation (Q3310623):
Displaying 16 items.
- Width and mode of the profile for some random trees of logarithmic height (Q997955) (← links)
- On the average internal path length of m-ary search trees (Q1060015) (← links)
- On growing random binary trees (Q1076401) (← links)
- Random sequential bisection and its associated binary tree (Q1091019) (← links)
- Applications of the theory of records in the study of random trees (Q1110339) (← links)
- On the joint distribution of the insertion path length and the number of comparisons in search trees (Q1121028) (← links)
- Second phase changes in random \(m\)-ary search trees and generalized quicksort: Convergence rates (Q1394520) (← links)
- On weighted depths in random binary search trees (Q1800490) (← links)
- The properties of random trees (Q1825678) (← links)
- Limiting probabilities for vertices of a given rank in 1-2 trees (Q2323818) (← links)
- Limit laws for local counters in random binary search trees (Q3352193) (← links)
- EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES (Q3430661) (← links)
- Universal Limit Laws for Depths in Random Trees (Q4210155) (← links)
- On random cartesian trees (Q4286297) (← links)
- Note on the heights of random recursive trees and random <i>m</i>‐ary search trees (Q4286299) (← links)
- On a random search tree: asymptotic enumeration of vertices by distance from leaves (Q5233192) (← links)