Pages that link to "Item:Q1872435"
From MaRDI portal
The following pages link to The profile of binary search trees (Q1872435):
Displaying 19 items.
- The degree profile of random Pólya trees (Q439063) (← links)
- Maximal flow in branching trees and binary search trees (Q655924) (← links)
- The shape of unlabeled rooted random trees (Q710724) (← links)
- On the silhouette of binary search trees (Q983879) (← links)
- A functional limit theorem for the profile of \(b\)-ary trees (Q988760) (← links)
- Width and mode of the profile for some random trees of logarithmic height (Q997955) (← links)
- Edgeworth expansions for profiles of lattice branching random walks (Q1700407) (← links)
- General Edgeworth expansions with applications to profiles of random trees (Q1704141) (← links)
- A functional limit theorem for the profile of random recursive trees (Q1725478) (← links)
- Geometry of weighted recursive and affine preferential attachment trees (Q2042867) (← links)
- Search trees: metric aspects and strong limit theorems (Q2454410) (← links)
- A functional limit theorem for the profile of search trees (Q2476407) (← links)
- Limit Theorems for Subtree Size Profiles of Increasing Trees (Q2888869) (← links)
- Random Records and Cuttings in Binary Search Trees (Q3058297) (← links)
- Width of a scale-free tree (Q3367752) (← links)
- Weak convergence of the number of vertices at intermediate levels of random recursive trees (Q4611274) (← links)
- Random walks with preferential relocations and fading memory: a study through random recursive trees (Q5131512) (← links)
- Profiles of random trees: correlation and width of random recursive trees and binary search trees (Q5694147) (← links)
- On martingale tail sums for the path length in random trees (Q5739101) (← links)