Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.AofA.2018.1
URN: urn:nbn:de:0030-drops-88943
URL: https://drops.dagstuhl.de/opus/volltexte/2018/8894/
Devroye, Luc
OMG: GW, CLT, CRT and CFTP (Flajolet Award Lecture)
| pdf-format: |
|
Abstract
After a brief review of the main results on Galton-Watson trees from the past two decades, we will discuss a few recent results in the field.
BibTeX - Entry
@InProceedings{devroye:LIPIcs:2018:8894,
author = {Luc Devroye},
title = {{OMG: GW, CLT, CRT and CFTP (Flajolet Award Lecture)}},
booktitle = {29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-078-1},
ISSN = {1868-8969},
year = {2018},
volume = {110},
editor = {James Allen Fill and Mark Daniel Ward},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8894},
URN = {urn:nbn:de:0030-drops-88943},
doi = {10.4230/LIPIcs.AofA.2018.1},
annote = {Keywords: Galton-Watson trees, applied probability, asymptotics, simply generated trees}
}
| Keywords: | Galton-Watson trees, applied probability, asymptotics, simply generated trees | |
| Seminar: | 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 18.06.2018 |
