The space requirement of m-ary search trees: distributional asymptotics for m >= 27

Details The space requirement of m-ary search trees: distributional asymptotics for m >= 27 The space requirement of m-ary search trees: distributional asymptotics for m >= 27

2004-05-08

arxiv.org/abs/math/0405144v1

Mathematics

Probability

10 pages, 1 figure

Scientific paper

We study the space requirement of $m$-ary search trees under the random permutation model when $m \geq 27$ is fixed. Chauvin and Pouyanne have shown recently that $X_n$, the space requirement of an $m$-ary search tree on $n$ keys, equals $\mu (n+1) + 2\Re{[\Lambda n^{\lambda_2}]} + \epsilon_n n^{\Re{\lambda_2}}$, where $\mu$ and $\lambda_2$ are certain constants, $\Lambda$ is a complex-valued random variable, and $\epsilon_n \to 0$ a.s. and in $L^2$ as $n \to \infty$. Using the contraction method, we identify the distribution of $\Lambda$.

Affiliated with

Also associated with

No associations

Rating

The space requirement of m-ary search trees: distributional asymptotics for m >= 27 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The space requirement of m-ary search trees: distributional asymptotics for m >= 27, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The space requirement of m-ary search trees: distributional asymptotics for m >= 27 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-111875