On the Horton-Strahler number for random tries
From MaRDI portal
Publication:3126013
DOI10.1051/ita/1996300504431zbMath0867.68087OpenAlexW1522003137MaRDI QIDQ3126013
Paul Kruszewski, Luc P. Devroye
Publication date: 23 March 1997
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92545
Related Items (2)
A note on the Horton-Strahler number for random binary search trees ⋮ On the Stack-Size of General Tries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrice de ramification des arbres binaires. (Ramification matrices of binary trees)
- Asymptotical growth of a class of random trees
- The average number of registers needed to evaluate a binary tree optimally
- The number of registers required for evaluating arithmetic expressions
- A note on the Horton-Strahler number for random trees
- On programming of arithmetic operations
- On Horton's Law for Random Channel Networks
- On the Order of Random Channel Networks
- A note on the probabilistic analysis of patricia trees
- Dynamic hashing
- Probability Inequalities for Sums of Bounded Random Variables
This page was built for publication: On the Horton-Strahler number for random tries
