Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Discrete mathematics & theoretical computer science
Tome DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science (2008)
Précédent
Suivant
DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science
The continuous limit of large random planar maps
Le Gall, Jean-François
Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding
Szpankowski, Wojciech
Point process stabilization methods and dimension estimation
Yukich, J. E.
Error bounds in stochastic-geometric normal approximation
Penrose, Mathew
;
Rosoman, Tom
Concentration of measure and mixing for Markov chains
Luczak, Malwina
The height of random binary unlabelled trees
Broutin, Nicolas
;
Flajolet, Philippe
The register function for lattice paths
Louchard, Guy
;
Prodinger, Helmut
The Degree Distribution of Thickened Trees
Drmota, Michael
;
Gittenberger, Bernhard
;
Panholzer, Alois
Degree distribution in random planar graphs
Drmota, Michael
;
Gimenez, Omer
;
Noy, Marc
Constructions for Clumps Statistics.
Bassino, Frédérique
;
Clément, Julien
;
Fayolle, Julien
;
Nicodème, Pierre
Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers
Eagle, Christopher
;
Gao, Zhicheng
;
Omar, Mohamed
;
Panario, Daniel
;
Richmond, Bruce
On square permutations
Duchi, Enrica
;
Poulalhon, Dominique
Polynomial tails of additive-type recursions
Schopp, Eva-Maria
Small parts in the Bernoulli sieve
Gnedin, Alexander
;
Iksanov, Alex
;
Roesler, Uwe
On the number of zero increments of random walks with a barrier
Iksanov, Alex
;
Negadajlov, Pavlo
Evaluation of a Special Hankel Determinant of Binomial Coefficients
Eugeciouglu, Ömer
;
Redmond, Timothy
;
Ryavec, Charles
Random Records and Cuttings in Split Trees: Extended Abstract
Holmgren, Cecilia
A variant of the Recoil Growth algorithm to generate multi-polymer systems
Simatos, Florian
Analysis of an algorithm catching elephants on the Internet
Chabchoub, Yousra
;
Fricker, Christine
;
Meunier, Frédéric
;
Tibi, Danielle
Convergence to the coalescent and its relation to the time back to the most recent common ancestor
Möhle, Martin
Generating Functions of Stochastic L-Systems and Application to Models of Plant Development
Loi, Cedric
;
Cournède, Paul Henry
A functional limit law for the profile of plane-oriented recursive trees.
Sulzbach, Henning
Hopcroft's automaton minimization algorithm and Sturmian words
Berstel, Jean
;
Boasson, Luc
;
Carton, Olivier
Are even maps on surfaces likely to be bipartite?
Chapuy, Guillaume
Branching processes in random environment die slowly
Vatutin, Vladimir
;
Kyprianou, Andreas
On subcritical multi-type branching process in random environment
Dyakonova, Elena
Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups
Gilch, Lorenz A.
A Note on the Transience of Critical Branching Random Walks on the Line
Alsmeyer, Gerold
;
Meiners, Matthias
Subcritical pattern languages for and/or trees
Kozik, Jakub
On density of truth of the intuitionistic logic in one variable
Kostrzycka, Zofia
On the density and the structure of the Peirce-like formulae
Genitrini, Antoine
;
Kozik, Jakub
;
Matecki, Grzegorz
Boltzmann Oracle for Combinatorial Systems
Pivoteau, Carine
;
Salvy, Bruno
;
Soria, Michèle
A note on the fragmentation of a stable tree
Marchal, Philippe
A Markov Chain Algorithm for determining Crossing Times through nested Graphs
Freiberg, Uta
;
Thäle, Christoph
The size of random fragmentation intervals
Aguech, Rafik
Volume Laws for Boxed Plane Partitions and Area Laws for Ferrers Diagrams
Schwerdtfeger, Uwe
Plane recursive trees, Stirling permutations and an urn model
Janson, Svante
Analytic Combinatorics of the Mabinogion Urn
Flajolet, Philippe
;
Huillet, Thierry