Third Colloquium on Mathematics and Computer Science


Below you can find the program for the week.

Monday, September 13
09:00-10:00Svante Janson, Random cuttings and records in trees
10:00-10:30coffee break
10:30-11:00Gilles Schaeffer, A combinatorial approach to jumping particles II: general boundary conditions
11:00-11:30Brigitte Vallée, Hausdorff dimension of real numbers with bounded digit averages
11:45-12:15Eric Fekete, Arms and feet nodes level polynomial in binary search trees
12:15-12:45Julien Fayolle, An average-case analysis of basic parameters of the suffix tree
14:00-15:00Mireille Bousquet-Mélou, Are algebraic generating functions ordinary?
15:00-15:30coffee break
15:30-16:00Martin Rubey, Transcendence of generating functions of walks on the slit plane
16:00-16:30Jeremy Lovejoy, Overpartitions and generating functions for generalized Frobenius partitions
16:45-17:15Guy Louchard, Common intervals in permutations
17:15-17:45Luca Ferrari, Enumerative results and problems on integer partitions using the ECO method
17:45-18:15Eugenijus Manstavicius, Iterated logarithm laws and the cycle lengths of a random permutation
Tuesday, September 14
08:45-09:45Boris Pittel, Limit shapes for random square Young tableaux and plane partitions
09:45-10:15coffee break
10:15-10:45Ludger Rüschendorf, A Markov chain algorithm for Eulerian orientation of planar triangular graphs
10:45-11:15Robert Cori, Avalanche polynomials of some families of graphs
11:30-12:00Mindaugas Bloznelis, On combinatorial Hoeffding decomposition and asymptotic normality of subgraph count statistics
12:00-12:30Hervé Daudé, Coarse and sharp thresholds for random generalized satisfyability problems
12:40conference photo
14:00-15:00Jean-Francois Marckert, A continuous limit for quadrangulations
15:00-15:30coffee break
15:30-16:00Cyril Furtlehner, Stochastic deformations of sample paths of random walks and exclusion models
16:00-16:30Jean Mairesse, Random Walks on Groups With a Tree-Like Cayley Graph
16:45-17:15Bernard Ycart, Average case analysis for the Probabilistic Bin Packing Problem
17:15-17:45Conrado Martinez, An efficient algorithm for the generation of unlabelled cycles
17:45-18:15David Coupier, A zero-One law for first order logic on random images
19:00Reception at the Technical University
Wednesday, September 15
08:45-09:45Jean Bertoin, Dual random fragmentation and coagulation and an application to the genealogy of Yule processes
09:45-10:15coffee break
10:15-10:45Alain Rouault, Large deviations for cascades and cascades of large deviations
10:45-11:15Philippe Marchal, Nested regenerative sets and their fragmentation process
11:30-12:00Vladimir Vatutin, Yaglom type limit theorem for branching processes in random environment
12:00-12:30Valentin Topchii, Two-dimensional limit theorem for a critical catalytic branching random walk
14:00-22:00excursion to Stift Melk and Dürnstein and to a Heuriger
Thursday, September 16, Special Day for Helmut Prodinger on the Occasion of his 50th Birthday
09:00-10:00Christian Krattenthaler, Exact and asymptotic enumeration of non-intersecting lattice paths with a wall interaction
10:00-10:30coffee break
10:30-11:00Peter Grabner, 15 Years of Collaboration with Helmut Prodinger - A Personal View
11:00-11:30Wolfgang Woess, Lamplighter random walks
11:45-12:15Margaret Archibald, Restrictions on the position of the maximum/minimum in a geometrically distributed sample
12:15-12:45Arnold Knopfmacher, The number of descents in samples of geometric random variables
14:00-15:00Hsien-Kuei Hwang, The BST-profile phenomena in random search trees
15:00-15:30coffee break
15:30-16:00Alois Panholzer, Destruction of recursive trees
16:00-16:30Michael Schlosser, Some curious q-series expansions and beta integral evaluations
16:45-18:15Poster session
Javiera Barrera and Christian Paroissin, On the stationary search cost for the Move-To-Root rule with random weights
M. S. Bratiychuck, Semi-Markov Walks in Queueing and Risk Theory
Adriana Climescu - Haulica, Large deviation analysis of space-time Trellis codes
Alexander Gnedin, Regenerative composition structures
Pawel Hitczenko, Jeremy Johnson, and Hung-Jen Huang, Distribution of a class of didive and conquer recurrences arizing from the computation of the Walsh-Hadamard transform
Mehri Javanian, Multidimensional Interval Trees
Nadia Lalam and Christine Jacob, Estimation of the offspring mean for a general class of size-dependent branching processes. Application to Quantitative Polymerase Chain Reaction
Toufik Mansour, 321-avoiding permutations and chebyshev polynomials
Anne Micheli and Dominique Rossin, Edit distance between unlabelled ordered trees
Malgorzata Moczurad and Wlodzimierz Moczurad, Decidability of simple brick codes
Kate Morris, On some parameters in monotonically labelled tree structures
Tatiana Mylläri, Number of vertices of a given outdegree in a Galton-Watson forest
Stavros D. Nikolopoulos and Charis Papadopoulos, The Number of Spanning Trees in P4-reducible Graphs
Yuriy A. Reznik and Anatoly V. Anisimov, Using tries for universal data compression
Klaus Simon, Remarks on q-series, divisor functions and pentagonal numbers
19:00Conference Dinner
Friday, September 17
08:45-09:45Simon Tavaré, A tale of three couplings: Poisson-Dirichlet and GEM approximations for random permutations
09:45-10:15coffee break
10:15-10:45Amke Caliebe, Representation of fixed points of a smoothing transformation
10:45-11:15Uwe Rösler, Stochastic fixed points involving the maximum
11:30-12:00 Joel Ratsaby, A constrained version of Sauer's Lemma
12:00-12:30Ralph Neininger, Probabilistic analysis for randomized game tree evaluation
14:00-14:30 Guy Fayolle, Stochastic chemical kinetics with energy parameters
14:30-15:00Christiane Takacs, Partitioning with piecewise constant eigenvectors
15:00-15:30coffee break
15:30-16:00Laszlo Györfi, Large deviations of Hellinger distance on partitions
16:00-16:30Omer Gimenez, Estimating the growth constant of labelled planar graphs
17:00-17:30Philippe Duchon, New Strahler number for rooted plane trees
17:30-18:00Shuji Kijima, Polynomial time perfect sampling algorithm for two-rowed contingency tables