The height of -binary search trees.
Drmota, Michael, Prodinger, Helmut (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
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 “Numerical studies of the asymptotic height distribution in binary search trees.”
The height of -binary search trees.
Right-cancellability of a family of operations on binary trees.
Duchon, Philippe (1998)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Descendants and ascendants in binary trees.
Panholzer, Alois, Prodinger, Helmut (1997)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
On the Horton-Strahler number for combinatorial tries
Markus E. Nebel (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Probabilistic proofs of hook length formulas involving trees.
Sagan, Bruce E. (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
On A-Trees
Đuro Kurepa (1968)
Publications de l'Institut Mathématique
Similarity:
Some remarks on the enumeration of rooted trees
Z. A. Łomnicki (1973)
Applicationes Mathematicae
Similarity:
Bijective proofs of identities from colored binary trees.
Yan, Sherry H.F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
-trees and normalization of pseudogroups.
Rimlinger, Frank (1992)
Experimental Mathematics
Similarity:
On some hypotheses concerning trees.
D. Kurepa (1977)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Binary trees, fringe thickness and minimum path length
Helen Cameron, Derick Wood (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: