The limiting common distribution of two leaf heights in a random binary tree
W. Gutjahr, G. Ch. Pflug (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Exact and asymptotic distributions in digital and binary search trees”
The limiting common distribution of two leaf heights in a random binary tree
On the average number of registers needed to evaluate a special class of backtrack trees
U. Trier (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A limiting distribution for quicksort
Mireille Régnier (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Digital search trees with keys of variable length
Markus E. Nebel (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the Horton-Strahler number for combinatorial tries
Markus E. Nebel (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On a tree collision resolution algorithm in presence of capture
U. Schmid (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Uniformly growing backtrack trees
Rainer Kemp (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: