OMG: GW, CLT, CRT and CFTP (Flajolet Award Lecture)

Author Luc Devroye



PDF
Thumbnail PDF

File

LIPIcs.AofA.2018.1.pdf
  • Filesize: 177 kB
  • 1 pages

Document Identifiers

Author Details

Luc Devroye
  • School of Computer Science, McGill University, 3480 University St., Montreal, Canada H3A 0E9, http://luc.devroye.org/

Cite AsGet BibTex

Luc Devroye. OMG: GW, CLT, CRT and CFTP (Flajolet Award Lecture). In 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 110, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.AofA.2018.1

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.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Trees
  • Mathematics of computing → Probability and statistics
Keywords
  • Galton-Watson trees
  • applied probability
  • asymptotics
  • simply generated trees

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail