On binary search tree recursions with monomials as toll functions

This publication has 11 references indexed in Scilit:

• Binary search tree recursions with harmonic toll functions
  Journal of Computational and Applied Mathematics, 2002
• On the analysis of stochastic divide and conquer algorithms
  Algorithmica, 2001
• The contraction method for recursive algorithms
  Algorithmica, 2001
• Smoothness and Decay Properties of the Limiting Quicksort Density Function
  Published by Springer Nature ,2000
• On the internal path length ofd-dimensional quad trees
  Random Structures & Algorithms, 1999
• Universal Limit Laws for Depths in Random Trees
  SIAM Journal on Computing, 1998
• Probability metrics and recursive algorithms
  Advances in Applied Probability, 1995
• A fixed point theorem for distributions
  Stochastic Processes and their Applications, 1992
• A limit theorem for “quicksort”
  RAIRO - Theoretical Informatics and Applications, 1991
• Some Asymptotic Theory for the Bootstrap
  The Annals of Statistics, 1981