One-sided variations on interval trees
From MaRDI portal
Recommendations
Cites work
- A limit theorem for “quicksort”
- A note on the height of binary search trees
- How to select a loser
- scientific article; zbMATH DE number 3171475 (Why is no real title available?)
- scientific article; zbMATH DE number 53861 (Why is no real title available?)
- scientific article; zbMATH DE number 3230499 (Why is no real title available?)
- scientific article; zbMATH DE number 3308309 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- On the contraction method with degenerate limit equation.
- On the distribution for the duration of a randomized leader election algorithm
- One-sided variations on binary search trees
- Random sequential bisection and its associated binary tree
Cited in
(11)- Normal limiting distribution of the size of binary interval trees
- Fragment size distributions in random fragmentations with cutoff
- One-sided variations on binary search trees
- Paths in \(m\)-ary interval trees
- Probabilistic analysis of maximal gap and total accumulated length in interval division
- One-sided interval trees
- scientific article; zbMATH DE number 2127736 (Why is no real title available?)
- scientific article; zbMATH DE number 5606397 (Why is no real title available?)
- The maximal gap in division of one-sided interval trees
- Perpetuities in fair leader election algorithms
- The size of random fragmentation trees
This page was built for publication: One-sided variations on interval trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4462695)