scientific article; zbMATH DE number 1052336

zbMATH Open0879.60084MaRDI QIDQ4349938FDOQ4349938

Authors: Volker Bruhn 

Publication date: 26 August 1997

Title of this publication is not available (Why is that?)

Recommendations

• A limit theorem for “quicksort”
• Asymptotic distributions for random median quicksort
• On a multivariate contraction method for random recursive structures with applications to quicksort
• How Many Comparisons Does Quicksort Use?
• Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions

zbMATH Keywords

stochastic analysis of the quicksort algorithm

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Central limit and other weak theorems (60F05) Applications of renewal theory (reliability, demand theory, etc.) (60K10) Renewal theory (60K05)

Cited In (4)

• Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
• The total path length of split trees
• Asymptotic distributions for random median quicksort
• On the analysis of stochastic divide and conquer algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4349938)