On the expected height of fringe-blanced trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 53861 (Why is no real title available?)
- scientific article; zbMATH DE number 88944 (Why is no real title available?)
- scientific article; zbMATH DE number 3233336 (Why is no real title available?)
- A note on the height of binary search trees
- Branching processes in the analysis of the heights of trees
- Chernoff's theorem in the branching random walk
- Locally balanced binary trees
- On growing random binary trees
- On the height of random m‐ary search trees
- Postulates for subadditive processes
- Subadditive ergodic theory
- The analysis of a fringe heuristic for binary search trees
- The first- and last-birth problems for a multitype age-dependent branching process
- Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
Cited in
(10)- The asymptotic distribution of cluster sizes for supercritical percolation on random split trees
- Balancing \(m\)-ary search trees with compressions on the fringe
- Inversions in split trees and conditional Galton-Watson trees
- The fluctuations of the giant cluster for percolation on random split trees
- Height balance distribution of search trees
- Weighted height of random trees
- The theory of fringe analysis and its application to 23 trees and b-trees
- The existence of a giant cluster for percolation on large Crump–Mode–Jagers trees
- scientific article; zbMATH DE number 4008411 (Why is no real title available?)
- On rotations in fringe-balanced binary trees
This page was built for publication: On the expected height of fringe-blanced trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323353)
