Oberwolfach Reports


Full-Text PDF (409 KB) | Introduction as PDF | Metadata | Table of Contents | OWR summary
Volume 1, Issue 3, 2004, pp. 2133–2170
DOI: 10.4171/OWR/2004/41

Published online: 2005-06-30

Probability Theory on Trees and Analysis of Algorithms

Gerold Alsmeyer[1], Luc Devroye[2] and Uwe Rösler[3]

(1) Universität Münster, Germany
(2) McGill University, Montreal, Canada
(3) Christian-Albrechts-Universität zu Kiel, Germany

The analysis of algorithms and data structures, started by D. Knuth, is a rapidly growing area at the interface of Mathematics and Theoretical Computer Science. Probability theory enters the subject in a natural way when studying an algorithm as to its performance over randomized inputs and/or if an algorithm itself takes randomization steps. The latter holds true for so-called divide and conquer algorithms, which were a central topic of this workshop. The sorting algorithm {\alsmeyercmc Quicksort} is presumably the most prominent example. While early work was mostly based on the generating function approach, the last two decades have seen an increasing number of contributions based on probabilistic methods involving martingales, random trees and other stochastic processes. The first article of this type was written in the eighties by L.\ Devroye, a Humboldt award winner of 2004 and also one of the organizers. Later another pioneering contribution came by U.\ R\"osler who, by introducing weighted branching processes and the contraction method, determined the asymptotic distributional behavior of {\alsmeyercmc Quicksort}. One can say that much of the work presented at this workshop is to some extent spawn by these articles. The aim and scope of the mini-workshop was to bring together leading junior and senior experts in the field with a strong probabilistic background and a focus on divide an conquer algorithms and related data structures. There were 16 one hour talks presented by 12 of the 14 participants from 7 countries. Main topics were branching processes, the contraction method, the asymptotic analysis of random trees, stochastic fixed point equations and randomized algorithms.

No keywords available for this article.

Alsmeyer Gerold, Devroye Luc, Rösler Uwe: Probability Theory on Trees and Analysis of Algorithms. Oberwolfach Rep. 1 (2004), 2133-2170. doi: 10.4171/OWR/2004/41