Probability, Trees and Algorithms

  • Luc Devroye

    McGill University, Montreal, Canada
  • Ralph Neininger

    J. W. Goethe-Universität, Frankfurt, Germany
Probability, Trees and Algorithms cover
Download PDF

A subscription is required to access this article.


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.

Cite this article

Luc Devroye, Ralph Neininger, Probability, Trees and Algorithms. Oberwolfach Rep. 11 (2014), no. 4, pp. 2825–2871

DOI 10.4171/OWR/2014/50