Sciweavers

11231 search results - page 2247 / 2247
» Digging for Data Structures
Sort
View
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 5 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
« Prev « First page 2247 / 2247 Last » Next »