An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms

This publication has 68 references indexed in Scilit:

• Phase changes in random m‐ary search trees and generalized quicksort
  Random Structures & Algorithms, 2001
• Transitional behaviors of the average cost of quicksort with median-of-(2t + 1)
  Algorithmica, 2001
• Distribution of the number of consecutive records
  Random Structures & Algorithms, 2000
• General Balanced Trees
  Journal of Algorithms, 1999
• Engineering a sort function
  Software: Practice and Experience, 1993
• The asymptotic distributions of the remedians
  Journal of Statistical Planning and Inference, 1993
• Height balance distribution of search trees
  Information Processing Letters, 1991
• Improving quicksort performance with a codeword data structure
  IEEE Transactions on Software Engineering, 1989
• Some average measures in m-ary search trees
  Information Processing Letters, 1987
• Best sorting algorithm for nearly sorted lists
  Communications of the ACM, 1980