# Slides of Talks

## Invited talks

Neil J. A. Sloane,

*Confessions of a Sequence Addict*.Sourav Chatterjee,

*A general method for lower bounds on ď¬‚uctuations of random variables*.Bruno Salvy,

*Diagonals: Combinatorics, Asymptotics and Computer Algebra*.Michael Fuchs,

*Asymptotic and Exact Poissonized Variance in the Analysis of Random Digital Trees*.Cecilia Homlgren,

*Split Trees and Galton-Watson Trees*.

## Contributed talks

Cheyne Homberger,

*Distribution of patterns within random restricted permutations*.Maryam Bahrani,

*An Exact Enumeration of Unlabeled Cactus Graphs*.Bernhard Gittenberger,

*Enumerating lambda terms by weighted length of their de Bruijn representation*.Laura Eslava,

*High degree vertices on recursive trees*.Daniel Krenn,

*Analysis of the optimal multi-pivot quicksort*.Philippe Jacquet,

*DePoissonization—vingt ans après, closing the loop*.Mihyun Kang,

*A randomised algorithm for the k-core in random graphs*(whiteboard talk).Charles Karney,

*Sampling exactly from the normal distribution*.Robert Sedgewick,

*21st Century Model for Disseminating Knowledge*.Jim Fill,

*A local limit theorem for QuickSort key comparisons via multi-round smoothing*.Clemens Heuberger,

*Number of Odd Entries in Pascal’ Rhombus and Analysis of q-Contributed Sequences*.Alexey Gronskiy,

*Free Energy Asymptotics for Some Combinatorial Problems and its Application to Robust Solution*.Michael Drmota,

*Universal asymptoticsfor positive catalytic functional equations*.Jérémie Lumbroso,

*Graph Enumeration with the Split-Decomposition*.Wojciech Szpankowski,

*Entropy of Some Advanced Data Structures*.Manuel Lladser,

*Non-asymptotic approximation of Markov chain functionals in transient regimes*.Cyril Banderier,

*Patterns in random walks*.Zbigniew Golebiewski,

*On Structural Entropy of Uniform Random Intersection Graphs*.Brigitte Vallée,

*The Quintet Poisson–Mellin–Newton–Rice–Laplace*.Sebastian Wild,

*Median-of-k Quicksort is optimal for many equal keys*.Mireille Régnier,

*Repetition length in random sequences*.Ricardo Gómez,

*Asymptotic problems arising in the classification of symbolic dynamical systems*.Benjamin Hackl,

*Growing and Destroying Classes of Plane Trees*.Gustavo Lau,

*Open Problems and Directions in the Analysis of Partial Match*.Henning Sulzbach,

*Galton-Watson trees and Apollonian networks*.