Oberwolfach Reports


Full-Text PDF (781 KB) | Introduction as PDF | Metadata | Table of Contents | OWR summary
Volume 11, Issue 4, 2014, pp. 2825–2871
DOI: 10.4171/OWR/2014/50

Published online: 2015-10-29

Probability, Trees and Algorithms

Luc Devroye[1] and Ralph Neininger

(1) McGill University, Montreal, Canada

The subject of this workshop were probabilistic aspects of algorithms for fundamental problems such as sorting, searching, selecting of and within data, random permutations, algorithms based on combinatorial trees or search trees, continuous limits of random trees and random graphs as well as random geometric graphs. The deeper understanding of the complexity of such algorithms and of shape characteristics of large discrete structures require probabilistic models and an asymptotic analysis of random discrete structures. The talks of this workshop focused on probabilistic, combinatorial and analytic techniques to study asymptotic properties of large random combinatorial structures.

No keywords available for this article.

Devroye Luc, Neininger Ralph: Probability, Trees and Algorithms. Oberwolfach Rep. 11 (2014), 2825-2871. doi: 10.4171/OWR/2014/50