Multiway Trees of Maximum and Minimum Probability under the Random Permutation Model

DOI10.1017/S096354830000211XzbMath0863.68057MaRDI QIDQ2785369

James Allen Fill, Robert P. Dobrow

Publication date: 20 February 1997

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

search treesmultiway trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Transfer theorems and asymptotic distributional results for m‐ary search trees ⋮ On the variety of shapes in digital trees ⋮ On the Variety of Shapes on the Fringe of a Random Recursive Tree ⋮ QuickSort: improved right-tail asymptotics for the limiting distribution, and large deviations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Organization and maintenance of large ordered indexes
• On the height of random m‐ary search trees
• Analysis of the space of search trees under the random insertion algorithm
• Note on the heights of random recursive trees and random m‐ary search trees

This page was built for publication: Multiway Trees of Maximum and Minimum Probability under the Random Permutation Model