Fifth Colloquium on Mathematics and Computer Science

Algorithms, Trees, Combinatorics and Probabilities

Program

Back to Main page



Sunday 21th


16h Check-in

Monday 22th


9h-10h Jean-Francois Le Gall The continuous limit of large random planar maps
 
10h-10h15 Pause
 
10h15-10h45 Nicolas Broutin The height of random binary unlabeled trees slides
10h45-11h15 Helmut Prodinger The register function for lattice paths slides
 
11h15-11h30 Pause
 
11h30-12h00 Bernhard Gittenberger The Degree Distribution in Thickened Trees slides
12h-12h30 Marc Noy Degree distribution in random planar graphs slides
 
12h35-15h Lunch
 
15h-16h Wojciech Szpankowski Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding slides
 
16h-16h15 Pause
 
16h15-16h45 Pierre Nicodeme Constructions for Clumps Statistics slides
16h45-17h15 Daniel Panario The Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers slides
 
17h15-17h30 Pause
 
17h30-18h Enrica Duchi On square permutations slides
18h-18h30 Eva-Maria Schopp Polynomial tails of additive-type recursions slides
 
18h30 Dinner

Tuesday 23th


9h-10h Joseph E. Yukich Point process stabilization methods and dimension estimation slides
 
10h-10h15 Pause
 
10h15-10h45 Alexander Iksanov Small parts in the Bernoulli sieve slides
10h45-11h15 Pavlo Negadajlov On the number of zero increments of random walks with a barrier slides
 
11h15-11h30 Pause
 
11h30-12h Omer Egecioglu Evaluation of a Special Hankel Determinant of Binomial Coefficients slides
12h-12h30 Cecilia Holmgren Random Records and Cuttings in Split Trees slides
 
12h30-15h Lunch
 
15h-16h Mathew Penrose Error bounds in stochastic-geometric normal approximation
 
16h-16h15 Pause
 
16h15-16h45 Florian Simatos A variant of the Recoil-Growth algorithm to generate multi-polymer systems slides
16h45-17h15 Christine Fricker Analysis of an algorithm catching elephants on the Internet slides
 
17h15-17h30 Pause
 
17h30-18h Martin Moehle Convergence to the coalescent and its relation to the time back to the most recent common ancestor slides
18h-18h30 Cedric Loi Description of Complex Branching Processes with Stochastic L-Systems and Application to Model Plant Development slides
 
18h30 Dinner

Wednesday 24th


-->
9h-10h Ralph Neininger On the profile of random search trees slides
 
10h-10h15 Pause
 
10h15-10h45 Henning Sulzbach The profile of random plane oriented recursive trees
10h45-11h15 Olivier Carton Hopcroft's automaton minimization algorithm and Sturmian words slides
 
11h15-11h30 Pause
 
11h30-12h Guillaume Chapuy Are even maps on surfaces likely to be bipartite ?
 
12h15-13h Lunch
 
13h Bus Tour
18h30 Dinner

Thursday 25th


9h-10h Malwina Luczak Concentration of measure and mixing for Markov chains slides
 
10h-10h15 Pause
 
10h15-10h45 Vladimir Vatutin Branching Processes in random Environment die slowly slides
10h45-11h15 Carine Pivoteau Boltzmann Oracle for Combinatorial Systems slides
 
11h15-11h30 Pause
 
11h30-12h Lorenz A. Gilch Rate of Escape of Random Walks on Regular Languages and Amalgams of Finite Groups slides
12h-12h30 Gerold Alsmeyer A Note on the Transience of Critical Branching Random Walks on the Line slides
 
12h30-15h Lunch
 
15h-16h Philippe Chassaing Cellular Automata and Branching Ballistic Annihilation slides
 
16h-16h15 Pause
 
16h15-16h45 Jakub Kozik Subcritical Pattern Languages for and/or Trees slides
16h45-17h15 Zofia Kostrzycka On density of truth of intuitionistic logic slides
 
17h15-17h30 Pause
 
17h30-18h Grzegorz Matecki On the density and the structure of the Peirce-like formulae slides
 
18h30 Dinner

Friday 26th


9h-10h Angelika Steger On Boltzmann samplers and properties of combinatorial structures
 
10h-10h15 Pause
 
10h15-10h45 Philippe Marchal A note on the fragmentation of a stable tree slides
10h45-11h15 Uta Freiberg A Markov chain Algorithm for determining crossing times through nested graphs. slides
 
11h15-11h30 Pause
 
11h30-12h Uwe Schwerdtfeger Volume Laws for Boxed Plane Partitions and Area Laws for Ferrers Diagrams slides
12h-12h30 Svante Janson Plane recursive trees, Stirling permutations and an urn model slides
 
12h30-13h30 Lunch
 
13h30-14h Philippe Flajolet Analytic Combinatorics of the Mabinogion Urn slides
18h30 Dinner

Comments please to spitzmann@math.uni-kiel.de