𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees

✍ Scribed by Brigitte Chauvin; Michael Drmota

Book ID
106148666
Publisher
Springer
Year
2006
Tongue
English
Weight
268 KB
Volume
46
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the distribution of binary search tre
On the distribution of binary search trees under the random permutation model
✍ James Allen Fill πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 865 KB

We study the distribution Q on the set B, of binary search trees over a linearly ordered set of n records under the standard random permutation model. This distribution also arises as the stationary distribution for the move-to-root (MTR) Markov chain taking values in B,, when successive requests ar

Distribution of the size of random hash
Distribution of the size of random hash trees, pebbled hash trees and N-trees
✍ Costas A. Christophi; Hosam M. Mahmoud πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 91 KB

Devroye (SIAM J. Comput. 28 (1999) 1215 -1224) computed the average size of several random hash-based trees. We extend this analysis by ΓΏnding the central limit distribution for a suitably normalized version of the size of each of random hash trees, pebbled hash trees and N-trees. Because of a stron