The subject of this Mini-Workshop is the probabilistic analysis of random tree models that originate from applications in Computer Science. Emphasis is put on their connections to algorithms and information theory. Trees with a stochastic growth dynamic appear in Computer Science as data structures, in the context of coding schemes as well as connected to fundamental algorithms such as sorting, searching and selecting. The focus of this Mini-Workshop is on probabilistic and analytic techniques that have been developed recently in the asymptotic analysis of random trees such as martingale methods, connections to branching random walks, the contraction method, the method of moments as well as various techniques based on generating functions.
Cite this article
Ralph Neininger, Wojciech Szpanowski, Mini-Workshop: Random Trees, Information and Algorithms. Oberwolfach Rep. 8 (2011), no. 2, pp. 1241–1286DOI 10.4171/OWR/2011/23