Exact and asymptotic distributions in digital and binary search trees
G. Louchard (1987)
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.
Displaying similar documents to “The limiting common distribution of two leaf heights in a random binary tree”
Exact and asymptotic distributions in digital and binary search trees
On the Horton-Strahler number for random tries
L. Devroye, P. Kruszewski (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:
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:
On the Horton-Strahler number for combinatorial tries
Markus E. Nebel (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Rebalancing operations for deletions in AVL-trees
Athanasios K. Tsakalidis (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: