The versions provided below may present (very) slight differences with the published versions. If some links do not work, please, tell me!!
|
|
Artistic illustration |
Publications Coauthors Web Pages
The CRT is the scaling limit of
unordered binary trees
arXiv:
0902.4570 (version.ps.gz)
(version pdf)
To appear in
Random Structures and algorithms
With
Grégory Miermont
Uniform bounds
for the exponential moments of the maximum of Dyck paths
arXiv:0902.1229
(version.ps)
(version pdf)
With
O. Khorunzhiy, Electronic
Communications in Probability, (2009) paper 33, 327-333
Election algorithms with random
delays in trees
(version.ps.gz)
(version pdf)
With N. Saheb-Djahromi
and A. Zemmari, FPSAC 2009, to appear in DMTCS
A symmetry property of some harmonic algebraic
curves
(version.ps.gz)
(version pdf)
arXiv:0805.2016
Unpublished
With J.C. Aval
Some families of increasing
planar maps
(version.ps.gz)
(version pdf)
arXiv:0712.0593
With
M. Albenque Electronic
journal of probability, (2008), paper 56, 1624-1671.
One more approach to the
convergence of the empirical process to the Brownian bridge
(version.ps.gz)
(version pdf)
Arxiv :
abs/0710.3296
Electronic
journal of Statistics, Vol.2. (2008) p.118-126.
Directed Animals and Gas Models
Revisited
(revised
version of Directed animals in the gas)
(version.ps.gz)
(version pdf)(Arxiv
: math.PR/0611194)
With Y. Le
Borgne The
Electronic Journal of Combinatorics , R71, (2007).
The lineage process in
Galton-Watson trees and globally centered discrete snakes
(revised
version of Globally centered discrete snake)
(version.ps.gz)
(version pdf)
Arxiv :
math.PR/0606338
Annals
of Applied Probability, Vol. 18, No. 1, 209-244,
(2007)
Quasi-Optimal Energy-Efficient
Leader Election Algorithms in Radio Networks
(version.ps.gz)
(version pdf)
With C. Lavault
and V. Ravelomanana. Information
and Computation, Vol. 205, Issue 5, May (2007), p. 679-693
Asymptotics of Bernoulli random
walks, bridges, excursions and meanders with a given number of peaks
(version.ps.gz)
(version pdf) (Arxiv
: math.PR/0601624)
With
J.M. Labarbe. Electronic
journal of probability, (2007), p. 229-261.
Invariance principles for
random bipartite planar maps
(version
pdf)(Arxiv :
math.PR/0504110)
With G. Miermont
The
Annals of probability, (2007), Vol. 35, No.5, p. 1642-1705
|
On the reduction of a random
basis With A. Akhavi and A.
Rouault |
Short version : Analco,
Proceedings of the ninth workshop on algorithm engineering |
Limit of Normalized
Quadrangulations: the Brownian map
(not
the last version.ps.gz) (version pdf)
(Arxiv
: math.PR/0403398)
With A.
Mokkadem, The
Annals of probability, Vol. 34, No.6, p. 2144-2202, (2006)
Martingales and Profile of
Binary Search Trees
(version.ps.gz)
(version pdf)
(Long version: Arxiv :
math.PR/0410211)
With
B. Chauvin, T. Klein, A. Rouault Electronic
journal of probability, 10 (2005), no. 12, p. 420--435
Convergence of Discrete Snakes
(version.ps.gz)
(version pdf)
With S. Janson
Journal
of theoretical probability, 18, No. 3 , 615-- 645 (2005)
Reinforced weak convergence of
stochastic processes
(version
ps.gz) (version pdf)
With
Michael Drmota. Statistics
& Probability Letters, Vol. 71, Issue 3, 1 March (2005),
Pages 283-294
The rotation correspondence is
asymptotically a dilatation
(version.ps.gz)
(version pdf)
Random
Structures and Algorithms Vol. 24, Issue 2, (2004), p. 118-132
States spaces of the snake and
of its tour -- Convergence of the discrete snake
(version.ps.gz)
(version pdf)
With A.
Mokkadem. Journal
of theoretical probability, Vol. 16, No. 4, October (2003),
p.1015-1046.
Ladder variables, Internal
structure of Galton-Watson trees and Finite branching random walks
(version.ps.gz)
(version pdf)
With A.
Mokkadem. Journal
of Applied Probability, 40.3, 671- 689, (2003)
A Stochastically Quasi-Optimal
Search Algorithm for the Maximum of the Simple Random Walk
(version
ps.gz)(version pdf)
With P.
Chassaing & M. Yor. Annals
of Applied Probability, (2003) p. 1264-1295, vol 13, no. 4.
The depth first processes of
Galton-Watson trees converge to the same Brownian excursion
(version.ps.gz)
(version pdf)
With A.
Mokkadem. The
Annals of probability, Vol. 31, No. 3 - July, p. 1655-1678
(2003).
Non-crossing Trees are Almost
Conditioned Galton-Watson trees
(version
ps.gz) (version pdf)
With Alois
Panholzer Random
Structures and Algorithms, Vol 20.1, (2002), p.115-125
Parking with density
(version
ps.gz) (version pdf)
Random
Structures and Algorithms, Vol 18, 4,
p.364-380, (2001).
Parking functions, empirical
processes and the width of rooted labeled trees,
(version
ps.gz) (version pdf)
With P.
Chassaing. The
Electronic Journal of Combinatorics 8 (2001), R14.
The height and width of simple
trees
(version
ps.gz)(version pdf)
With P.
Chassaing and M. Yor. Mathematics
and Computer Science : Algorithms, Trees, Combinatorics
and Probabilities (Versailles 2000), p. 17-30.
Editors : D. Gardy,
A. Mokkadem - Birkhauser
The contour of size n general planar tree
(version ps.gz ) (version
pdf)
Unpublished (2000)
these
(PHD Thesis)
(version ps.gz) (version
pdf)
habilitation
(version ps.gz) (version
pdf)
Retour menu