On binary search tree recursions with monomials as toll functions

Journal of Computational and Applied Mathematics

Volumn 142, Issue 1, 2002, Pages 185-196

  Neininger, Ralph ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Analysis of algorithms; Contraction method; Fixed point equation; Probability density; Random binary search tree; Weak convergence

Indexed keywords

RECURSIVE FUNCTIONS; TREES (MATHEMATICS);

TOLL FUNCTIONS;

COMPUTATIONAL METHODS;

MATHEMATICAL ANALYSIS;

EID: 0036566412     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(01)00468-X     Document Type: Article

References (12)

1. Some asymptotic theory for the bootstrap
2. Universal limit laws for the depths in random trees
3. Smoothness and decay properties of the limiting Quicksort density function
4. Sorting algorithms for broadcast communications: Mathematical analysis
5. On the internal path length of d-dimensional quad trees
6. Binary search tree recursions with harmonic toll functions
7. Probability metrics and recursive algorithms
8. A limit theorem for "quicksort"
9. A fixed point theorem for distributions
10. The analysis of stochastic divide and conquer algorithms
11. The contraction method for recursive algorithms
12. Some properties of a limiting distribution in quicksort