Sciweavers

104 search results - page 1 / 21
» Limit distribution of degrees in random family trees
Sort
View
JCT
2007
150views more  JCT 2007»
13 years 4 months ago
On the degree distribution of the nodes in increasing trees
Abstract. Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e.,...
Markus Kuba, Alois Panholzer
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
13 years 6 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
DAM
2008
74views more  DAM 2008»
13 years 4 months ago
A distributional study of the path edge-covering numbers for random trees
Abstract. We study for various tree families the distribution of the number of edgedisjoint paths required to cover the edges of a random tree of size n. For all tree families cons...
Alois Panholzer
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 4 months ago
Universal Limit Laws for Depths in Random Trees
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...
Luc Devroye