Invited talks

• Piotr Indyk
  The sublinear world of data stream algorithms (abstract) (slides)
  
• Wolfgang Woess
  Lamplighter random walks on trees (abstract) (slides)
  
• Michael Drmota
  Concentration Properties of Extremal Parameters (paper) (slides)
  
• Johan Wästlund
  Random assignment and shortest path problems (paper)
• Laurent Viennot
  Some algorithmic aspects of peer-to-peer networks (slides)
  
• Grégory Miermont
  An invariance principle for random planar maps (paper) (slides)
  
• Gilles Schaeffer
  Maps on a surface of genus g
  
• Philippe Flajolet, Philippe Dumas, and Vincent Puyhaubert
  Some exactly solvable models of urn process theory (paper) (slides)
  

Contributed talks

• Olivier Gandouet and Alain Jean-Marie
  LogLog counting for IP traffic
  
• Jérémie Bourdon and Alban Mancheron
  Statistical Properties of Similarity Score Functions
  
• Sylvie Corteel, Jeremy Lovejoy and Olivier Mallet
  An extension to overpartitions of Rogers-Ramanujan identities for even moduli
  
• Frédérique Bassino and Cyril Nicaud
  Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers
  
• Zofia Kostrzycka
  Density of truth in modal logics
  
• Manuel Lladser
  Mixed Powers of Generating Functions
  
• Bergfinnur Durhuus, Thordur Jonsson and John Wheater
  On the spectral dimension of random trees
  
• Masao Ishikawa, Anisse Kasraoui and Jiang Zeng
  Computing generating functions of ordered partitions with the transfer-matrix method
  
• Chris Deugau and Frank Ruskey
  Generalized Meta-Fibonacci Sequences
  
• Toshio Nakata and Izumi Kubo
  A coupon collector's problem with bonuses
  
• Hanène Mohamed
  A probabilistic analysis of a leader election algorithm
  
• Louigi Addario-Berry, Nicolas Broutin and Bruce Reed
  The Diameter of the Minimum Spanning Tree of a Complete Graph
  
• Edward G. Belaga and Maurice Mignotte
  Walking Cautiously Into the Collatz Wilderness: Algorithmically, Number Theoretically, Randomly
  
• Charlotte Brennan and Arnold Knopfmacher
  The first ascent of size d or more in compositions
  
• Eda Cesaratto, Alain Plagne and Brigitte Vallée
  On the non randomness of modular arithmetic progressions
  
• Florent Hivert, Jean-Christophe Novelli and Jean-Yves Thibon
  Multivariate generalizations of the Foata-Schützenberger equidistribution
  
• Stephan G. Wagner
  On the number of decomposable trees
  
• Margaret Archibald and Julien Clément
  Average depth in a binary search tree with repeated keys
  
• Markus Kuba and Alois Panholzer
  Label-based parameters in increasing trees
  
• Svante Janson
  Conditioned Galton--Watson trees do not grow
  
• Gilbert Labelle, Louise Laforest and Xavier Provençal
  Around the root of random multidimensional quadtrees
  
• Cyril Banderier and Bernhard Gittenberger
  Enumeration and Asymptotics for the Area of Lattice Paths
  
• Sylvain Gravier and Bernard Ycart
  S-constrained random matrices
  
• Guy Louchard and Helmut Prodinger
  Analysis of a new skip list variant
  
• Elena Dyakonova
  Branching processes in random environment
  
• I. Fanti, A. Frosini, E. Grazzini, R. Pinzani and S. Rinaldi
  Polyominoes determined by permutations
  
• Alexander Gnedin
  Constrained exchangeable partitions
  

Contributed posters

• Gabriela Alexe, Gyan Bhanot and Adriana Climescu-Haulica
  A Cross Entropy Algorithm
  
• Reinhard Kutzelnigg
  Bipartite Random Graphs and Cuckoo Hashing
  
• Phan Thi Ha Duong and Tran Thi Thu Huong
  Structure of Stable Sand Piles Model
  
• Elmar Teufl and Stephan Wagner
  Spanning trees of finite Sierpinski graphs
  
• Alois Panholzer
  Left and right length of paths in binary trees
  
• Philippe Chassaing and Lucas Gerin
  Efficient estimation of the cardinality of large data sets
  
• Konstantin Borovkov and Vladimir Vatutin
  Trees with product-form random weights
  
• Christian Costermans and Hoang Ngoc Minh
  Explicit computation of the variance of the number of maxima in hypercubes
  
• Martin Rubey
  Extended Rate, more GFUN
  
• Yuri Pavlov
  Limit distribution of the size of the giant component in a web random graph
  
• Margaret Archibald and Arnold Knopfmacher
  Samples of geometric random variables with multiplicity constraints