4 search results - page 1 / 1 » Asymptotic variance of random symmetric digital search trees |
87
Voted
DMTCS
2010
14 years 10 months ago
2010
98
Voted
CPC
2002
15 years 25 days ago
2002
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
110
click to vote
JAL
2002
15 years 20 days ago
2002
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
116
click to vote
CORR
2004
Springer
15 years 26 days ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...