Sciweavers

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

9

SIAMCOMP
2002

favoriteEmaildiscussreport

139views more SIAMCOMP 2002»

Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees

13 years 4 months ago

Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees

Download cg.scs.carleton.ca

We consider sums of functions of subtrees of a random binary search tree, and obtain general laws of large numbers and central limit theorems. These sums correspond to random recurrences of the quicksort type, Xn L = XIn +Xn-1-In +Yn, n 1, where In is uniformly distributed on {0, 1, . . . , n - 1}, Yn is a given random variable, Xk L = Xk for all k, and given In, XIn and Xn-1-In are independent. Conditions are derived such that (Xn -

Luc Devroye

Real-time Traffic

Binary Search Tree | Random | Random Binary Search | SIAMCOMP 2002 |

claim paper

Related Content

» Subtree Sizes in Recursive Trees and Binary Search Trees BerryEsseen Bounds and Poisson Ap...

» Universal Limit Laws for Depths in Random Trees

» Profiles of Random Trees Limit Theorems for Random Recursive Trees and Binary Search Trees

» Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees

» Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions

» The Wiener Index Of Random Trees

» A limit process for partial match queries in random quadtrees

» Improved Limited Discrepancy Search

» Total Path Length For Random Recursive Trees

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	SIAMCOMP
Authors	Luc Devroye

Comments (0)