Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities

Table of Contents

Invited Speakers

Concentration Properties of Extremal Parameters PDF
Michael Drmota
Random assignment and shortest path problems PDF
Johan Wästlund
An invariance principle for random planar maps PDF
Grágory Miermont
Some exactly solvable models of urn process theory PDF
Philippe Flajolet, Philippe Dumas, Vincent Puyhaubert

Regular Contributions

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


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

Valid XHTML 1.0 Transitional