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:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A limiting distribution for quicksort”
The limiting common distribution of two leaf heights in a random binary tree
On the Horton-Strahler number for random tries
L. Devroye, P. Kruszewski (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Exact and asymptotic distributions in digital and binary search trees
G. Louchard (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A limit theorem for “quicksort”
Uwe Rösler (1991)
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:
Comparing classification tree structures : a special case of comparing -ary relations
Israël-César Lerman (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Rebalancing operations for deletions in AVL-trees
Athanasios K. Tsakalidis (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: