On binary search tree recursions with monomials as toll functions
From MaRDI portal
Publication:1612304
DOI10.1016/S0377-0427(01)00468-XzbMath1005.68115MaRDI QIDQ1612304
Publication date: 22 August 2002
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
60F05: Central limit and other weak theorems
68P10: Searching and sorting
60E10: Characteristic functions; other transforms
60E05: Probability distributions: general theory
68R10: Graph theory (including graph drawing) in computer science
05C99: Graph theory
Related Items
Limiting distributions for additive functionals on Catalan trees, Singularity analysis, Hadamard products, and tree recurrences
Cites Work
- Unnamed Item
- Unnamed Item
- Some asymptotic theory for the bootstrap
- A fixed point theorem for distributions
- Binary search tree recursions with harmonic toll functions
- The contraction method for recursive algorithms
- On the analysis of stochastic divide and conquer algorithms
- Sorting algorithms for broadcast communications: mathematical analysis.
- Some properties of a limiting distribution in Quicksort
- Universal Limit Laws for Depths in Random Trees
- Probability metrics and recursive algorithms
- A limit theorem for “quicksort”