Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

22

CORR
2011
Springer

favoriteEmaildiscussreport

215views Education» more CORR 2011»

The total path length of split trees

12 years 11 months ago

The total path length of split trees

Download algo.inria.fr

We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. The pieces of data (items) are stored in a randomized fashion in the nodes of a tree. The total path length (sum of depths of the items) is a natural measure of the efﬁciency of the algorithm/data structure. Using renewal theory, we prove convergence in distribution of the total path length towards a distribution characterized uniquely by a ﬁxed point equation. Our result covers, using a uniﬁed approach, many data structures such as binary search trees, m-ary search trees, quad trees, median-of-(2k + 1) trees, and simplex trees.

Nicolas Broutin, Cecilia Holmgren

Real-time Traffic

CORR 2011 | Data Structures | Education | Search Trees | Total Path Length |

claim paper

Related Content

» Approximation algorithms for the shortest total path length spanning tree problem

» Total Path Length For Random Recursive Trees

» Approximating Optimal Binary Decision Trees

» Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits

» TopDown Induction of Phylogenetic Trees

» Avoidance of multicast incapable branching nodes for multicast routing in WDM networks

» Efficient Construction of a Bounded Degree Spanner with Low Weight

» Survivable IP network design with OSPF routing

» Models of Adding Relations to a Linking Pin Type Organization Structure

Post Info
More Details (n/a)

Added	28 May 2011
Updated	28 May 2011
Type	Journal
Year	2011
Where	CORR
Authors	Nicolas Broutin, Cecilia Holmgren

Comments (0)