19 search results - page 1 / 4 » Analysis of Some Parameters for Random Nodes in Priority Tre... |
DMTCS
2008
14 years 10 months ago
2008
84
Voted
CPC
2004
14 years 10 months ago
2004
Heap ordered trees are planted plane trees, labelled in such a way that the labels always increase from the root to a leaf. We study two parameters, assuming that p of the n nodes ...
88
Voted
JAL
2002
14 years 9 months 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...
SIAMCOMP
1998
14 years 9 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
78
Voted
ALGORITHMICA
2005
14 years 10 months ago
2005
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...