Session I

9h-9h15 :   Opening of the Colloquium by D. Gentile, president of the University of Versailles Saint Quentin
9h15-10h :    L. Devroye (invited paper)
Rawa trees

10h20-10h50 :   M. Bousquet, C. Chauve, G. Labelle, P. Leroux 
A bijective proof of the arborescent form of the multivariable Lagrange's inversion formula
10h50-11h20 :  M. Dror, D. Fortin, C. Roucairol
Complexity issues for a redistribution problem
11h20-11h50 : E. Pergola, R. Pinzani, S. Rinaldi 
Towards an algebra of succession rules

12h-12h45 :  T. Dayar (invited paper)
Effects of reordering and lumping in the analysis of discrete-time SANs

Session II

 14h-14h45 : R. Pemantle (invited paper)
Generating functions with high-order poles are nearly polynomial

 14h55-15h25 : B. Ycart, M.C. Rousset
 A zero-one law for random sentences in description logics
 15h25-15h55 : A. de la Fortelle, F. Delcoigne
 Large deviations for polling systems
15h55-16h25 :  J. Berard, A. Bienvenue
 Convergence of a Genetic Algorithm with finite population

16h45-17h15 : V. Malyshev
Gibbs families
17h15-17h45 :  B. Derrida, S.C. Manrubia, D.H. Zanette
 Distribution of repetitions of ancestors in genealogical trees

18h-18h30 : Poster Session

18h30-19h30 : Welcome Party
 
 

Tuesday, September 19

Session III  

 9h15-10h : J. Spencer (invited paper)
Ultrahigh Moments for a Brownian Excursion

10h20-10h50 : M. Bousquet-Melou, G. Schaeffer
Counting paths on the slit plane
10h50-11h20 : M. Benmamou, N. Pekergin
Computing closed-form stochastic bounds on  the stationary distribution of Markov chains
11h20-11h50 : A. Denise, O. Rocques, M. Termier
Random generation of words of context-free languages according to the frequencies of letters

12h-12h45 :  J. Fill (invited paper)
Smoothness and decay properties of the limiting quicksort density function

Session IV

14h15-15h :  X. Viennot (invited paper)
Bijections for the Strahler distribution on trees and paths

15h10-15h40 :  P. Chassaing, J.F. Marckert, M. Yor
The height and width of simple trees
15h40-16h10 :  E. Locherbach
Likelihood ratio processes and asymptotic statistics for systems of interacting diffusions with branching and immigration
16h10-16h40 :  C. Mazza, D. Piau
On the rate of escape of a mutation-selection algorithm

17h-17h30 : Q. Liu
The branching  measure, Hausdorff and packing measures on the Galton-Watson tree
17h30-18h :  B. Gittenberger
The number of descendants in simply generated random trees

20h : Conference Dinner
 

Wednesday, September 20

Session V 

 9h15-10h : Y. Peres (invited paper)
Information flow on trees (joint work with E. Mossel)

10h20-10h50 :  J. Geiger
A new proof of Yaglom's exponential limit law
10h50-11h20 :  D. Merlini, R. Sprugnoli, M. C. Verri
 An algebra for generating trees
11h20-11h50 :  Y. Metivier, N. Saheb, A. Zemmari 
Randomized rendezvous

12h-12h45 :  G. Louchard (invited paper)
Probabilistic analysis of a Schroder walk generation algorithm

Session VI   

14h15-14h45 :  M. Dekking, S. de Graaf, L.E. Mester
On the node structure of binary search trees
14h45-15h15 :  P. Jacquet, W. Szpankowski, I. Apostol 
An universal predictor based on pattern matching, preliminary results

15h25-15h55 :  G. Fayolle, J.M. Lasgouttes
 A nonlinear integral operator encountered in the bandwidth sharing of a star-shaped network
15h55-16h25 :  M. Drmota
The saturation level in binary search tree

16h45-17h30 :  P. Flajolet  (invited paper)
Analytic Combinatorics of Parking and Hashing

17h30 : Closing of the Colloquium