Accepted Contributions to Mathinfo 2004
Papers
- Margaret Archibald, Restrictions on the
position of the maximum/minimum in a geometrically distributed sample
- David Auber et al., New Strahler number for rooted plane trees
- Monia Bellalouna, Salma Souissi, and Bernard Ycart, Average
case
analysis for the Probabilistic Bin Packing Problem
- Mindaugas Bloznelis, On combinatorial
Hoeffding
decomposition and asymptotic normality of subgraph count statistics
- Amke Caliebe, Representation of fixed points of a
smoothing transformation
- Eda Cesaratto and Brigitte Vallée, Hausdorff
dimension of real numbers with bounded digit averages
- Robert Cori, Arnaud Dartois, and Dominique Rossin, Avalanche
polynomials of some families of graphs
- Sylvie Corteel, Guy Louchard, and Robin Pemantle,
Common intervals in permutations
- Sylvie Corteel, Jeremy Lovejoy, and Ae Ja Yee, Overpartitions
and generating functions for generalized
Frobenius partitions
- David Coupier, Agnes Desolneux, and Bernard Ycart, A
zero-One law for first order logic on random images
- Nadia Creignou and Hervé Daudé, Coarse
and sharp
thresholds for random generalized satisfyability problems
- Enrica Duchi and Gilles Schaeffer, A combinatorial approach to jumping
particles II: general boundary conditions
- Guy Fayolle and Cyril Furtlehner, Stochastic
deformations of sample paths of random walks and exclusion models
- Guy Fayolle, Vadim Malyshev, and Serguei Pirogov, Stochastic
chemical kinetics with energy parameters
- Julien Fayolle, An average-case analysis of
basic parameters of the suffix tree
- Johannes Fehrenbach and Ludger Rueschendorf,
A Markov chain algorithm for
Eulerian orientation of planar triangular graphs
- Eric Fekete, Arms and feet nodes level
polynomial in binary search trees
- Luca Ferrari, Renzo Pinzani, and Simone Rinaldi, Enumerative
results and problems on integer partitions
using the ECO method
- Omer Gimenez and Marc Noy, Estimating the growth
constant of labelled planar graphs
- Laszlo Györfi, Large deviations of Hellinger
distance on partitions
- Peter Jagers and Uwe Roesler, Stochastic
fixed points involving the maximum
- Taemur Ali Khan and Ralph Neininger, Probabilistic
analysis for randomized game tree evaluation
- Shuji Kijima and Tomomi Matsui, Polynomial time
perfect sampling algorithm for two-rowed contingency tables
- Arnold Knopfmacher and Helmut Prodinger, The number of
descents in samples of geometric random variables
- Jean Mairesse and Frédéric Mathéus,
Random Walks on
Groups With a Tree-Like Cayley Graph
- Eugenijus Manstavicius, Iterated logarithm laws and
the cycle lengths of a random permutation
- Philippe Marchal, Nested regenerative sets and
their fragmentation process
- Conrado Martinez and Xavier Molinero, An efficient
algorithm for the generation of unlabelled cycles
- Alois Panholzer, Destruction of recursive trees
- Joel Ratsaby, A constrained version of Sauer's Lemma
- Alain Rouault, Large deviations for cascades and
cascades of large deviations
- Martin Rubey, Transcendence of generating functions of
walks on the slit plane
- Michael Schlosser, Some curious q-series expansions and beta integral
evaluations
- Christiane Takacs, Partitioning with piecewise
constant eigenvectors
- Vladimir Vatutin and Elena Dyakonova, Yaglom type
limit theorem for branching processes in random environment
- Vladimir Vatutin and Valentin Topchii, Two-dimensional
limit theorem for a critical catalytic branching random walk
Posters
- 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 divide and conquer
recurrences arising from the computation of the Walsh-Hadamard
transform
- Mehri Javanian, Multidimensional Interval Trees
- Toufik Mansour, 321-avoiding permutations
and chebyshev polynomials
- Simon Mavhungu and Tuwani Tshifhumulo, Unrestricted random walks
- 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
- 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
- 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
- Boris Ryabko and Alex Gammermann, Universal coding and tests for randomness
- Klaus Simon, Remarks on q-series, divisor
functions and pentagonal numbers