The properties of random trees
From MaRDI portal
Publication:1825678
DOI10.1016/0020-0255(89)90009-1zbMath0684.68085OpenAlexW2027091560MaRDI QIDQ1825678
Publication date: 1989
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(89)90009-1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A probabilistic analysis of the height of tries and of the complexity of triesort
- On growing random binary trees
- A note on the analysis of extendible hashing
- The average height of binary trees and other simple trees
- Axioms and hulls
- The expected linearity of a simple equivalence algorithm
- The number of registers required for evaluating arithmetic expressions
- Quad trees: A data structure for retrieval by composite keys
- Constant bounds on the moments of the height of binary search trees
- Trees, Forests and Rearranging
- On the efficiency of a new method of dictionary construction
- On the Most Probable Shape of a Search Tree Grown from a Random Permutation
- A note on the height of binary search trees
- Multidimensional binary search trees used for associative searching
- Sequence search trees: Their analysis using recurrence relations
- On the Altitude of Nodes in Random Trees
- Multidimensional Binary Search Trees in Database Applications
- More Combinatorial Properties of Certain Trees
- On the height of trees
- On the Distribution of the Number of Vertices in Strata of a Random Tree
- Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
This page was built for publication: The properties of random trees