Transitional behaviors of the average cost of quicksort with median-of-(2t + 1)

This publication has 17 references indexed in Scilit:

• Presorting algorithms: An average-case point of view
  Theoretical Computer Science, 2000
• A Poisson * Negative Binomial Convolution Law for Random Polynomials over Finite Fields
  Random Structures & Algorithms, 1998
• Sur la répartition des valeurs des fonctions arithmétiques. Le nombre de facteurs premiers d'un entier
  Journal of Number Theory, 1998
• Optimal sampling strategies in quicksort
  Published by Springer Nature ,1998
• On the expected height of fringe-balanced trees
  Acta Informatica, 1993
• Singularity Analysis of Generating Functions
  SIAM Journal on Discrete Mathematics, 1990
• Combinatorial analysis of quicksort algorithm
  RAIRO - Theoretical Informatics and Applications, 1989
• Saddle point approximation for the distribution of the sum of independent random variables
  Advances in Applied Probability, 1980
• A principle of independence for binary tree searching
  Acta Informatica, 1975
• Quicksort
  The Computer Journal, 1962