99-1   Berichtsreihe des Mathematischen Seminars der Universität Kiel

Uwe Rösler:

On the analysis of stochastic divide and conquer algorithms

This paper develops general tools for the analysis of stochastic divide and conquer algorithms. We concentrate on the average performance and the distribution of the running time of the algorithm. As a special example we analyse the average performance and the running time distribution of the $2k+1$-median version of QUICKSORT.

Mail an Jens Burmeister
[Thu Feb 19 18:56:34 2009]
Impressum