Table of Contents
Invited Speakers
| Concentration Properties of Extremal Parameters | |
| Michael Drmota |
| Random assignment and shortest path problems | |
| Johan Wästlund |
| An invariance principle for random planar maps | |
| Grágory Miermont |
| Some exactly solvable models of urn process theory | |
| Philippe Flajolet, Philippe Dumas, Vincent Puyhaubert |
Regular Contributions
| LogLog counting for IP traffic | |
| Olivier Gandouet, Alain Jean-Marie |
| Statistical Properties of Similarity Score Functions | |
| Jérémie Bourdon, Alban Mancheron |
| An extension to overpartitions of Rogers-Ramanujan identities for even moduli | |
| Sylvie Corteel, Jeremy Lovejoy, Olivier Mallet |
| Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers | |
| Frédérique Bassino, Cyril Nicaud |
| Density of truth in modal logics | |
| Zofia Kostrzycka |
| Mixed Powers of Generating Functions | |
| Manuel Lladser |
| On the spectral dimension of random trees | |
| Bergfinnur Durhuus, Thordur Jonsson, John Wheater |
| Computing generating functions of ordered partitions with the transfer-matrix method | |
| Masao Ishikawa, Anisse Kasraoui, Jiang Zeng |
| Generalized Meta-Fibonacci Sequences | |
| Chris Deugau, Frank Ruskey |
| A coupon collector's problem with bonuses | |
| Toshio Nakata, Izumi Kubo |
| A probabilistic analysis of a leader election algorithm | |
| Hanène Mohamed |
| The Diameter of the Minimum Spanning Tree of a Complete Graph | |
| Louigi Addario-Berry, Nicolas Broutin, Bruce Reed |
| Walking Cautiously Into the Collatz Wilderness: Algorithmically, Number Theoretically, Randomly | |
| Edward G. Belaga, Maurice Mignotte |
| The first ascent of size d or more in compositions | |
| Charlotte Brennan, Arnold Knopfmacher |
| On the non randomness of modular arithmetic progressions | |
| Eda Cesaratto, Alain Plagne, Brigitte Vallée |
| Multivariate generalizations of the Foata-Schützenberger equidistribution | |
| Florent Hivert, Jean-Christophe Novelli, Jean-Yves Thibon |
| On the number of decomposable trees | |
| Stephan G. Wagner |
| Average depth in a binary search tree with repeated keys | |
| Margaret Archibald, Julien Clément |
| Label-based parameters in increasing trees | |
| Markus Kuba, Alois Panholzer |
| Conditioned Galton-Watson trees do not grow | |
| Svante Janson |
| Around the root of random multidimensional quadtrees | |
| Gilbert Labelle, Louise Laforest, Xavier Provençal |
| Enumeration and Asymptotics for the Area of Lattice Paths | |
| Cyril Banderier, Bernhard Gittenberger |
| S-constrained random matrices | |
| Sylvain Gravier, Bernard Ycart |
| Analysis of a new skip list variant | |
| Guy Louchard, Helmut Prodinger |
| Branching processes in random environment | |
| Elena Dyakonova |
| Polyominoes determined by permutations | |
| I. Fanti, A. Frosini, E. Grazzini, R. Pinzani, S. Rinaldi |
| Constrained exchangeable partitions | |
| Alexander Gnedin |
Posters
| A Cross Entropy Algorithm | |
| Gabriela Alexe, Gyan Bhanot, Adriana Climescu-Haulica |
| Bipartite Random Graphs and Cuckoo Hashing | |
| Reinhard Kutzelnigg |
| Structure of Stable Sand Piles Model | |
| Phan Thi Ha Duong, Tran Thi Thu Huong |
| Spanning trees of finite Sierpiński graphs | |
| Elmar Teufl, Stephan Wagner |
| Left and right length of paths in binary trees | |
| Alois Panholzer |
| Efficient estimation of the cardinality of large data sets | |
| Philippe Chassaing, Lucas Gerin |
| Trees with product-form random weights | |
| Konstantin Borovkov, Vladimir Vatutin |
| Explicit computation of the variance of the number of maxima in hypercubes | |
| Christian Costermans, Hoang Ngoc Minh |
| Extended Rate, more GFUN | |
| Martin Rubey |
| Limit distribution of the size of the giant component in a web random graph | |
| Yuri Pavlov |
| Samples of geometric random variables with multiplicity constraints | |
| Margaret Archibald, Arnold Knopfmacher |
