13 search results - page 3 / 3 » Profiles of Random Trees: Limit Theorems for Random Recursiv... |
JCT
2007
13 years 5 months ago
2007
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.,...
BIOADIT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
SIAMCOMP
2002
13 years 5 months ago
2002
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...