Parking Functions, Empirical Processes, and the Width of Rooted Labeled Trees. - Philippe Chassaing; Jean-François Marckert (Electron. J. Comb., 2001)

Parking with density. - Jean-François Marckert (Random Struct. Algorithms, 2001)

Noncrossing trees are almost conditioned Galton-Watson trees. - Jean-François Marckert; Alois Panholzer (Random Struct. Algorithms, 2002)

The rotation correspondence is asymptotically a dilatation. - Jean-François Marckert (Random Struct. Algorithms, 2004)

A Quasi-Optimal Leader Election Algorithm in Radio Networks with Log-Logarithmic Awake Time Slots - Christian Lavault; Jean-François Marckert; Vlady Ravelomanana (CoRR, 2006)

Quasi-Optimal Leader Election Algorithms in Radio Networks with Loglogarithmic Awake Time Slots - Christian Lavault; Jean-François Marckert; Vlady Ravelomanana (CoRR, 2006)

Asymptotics of Bernoulli random walks, bridges, excursions and meanders with a given number of peaks - Jean-Maxime Labarbe; Jean-François Marckert (CoRR, 2006)

Directed animals in the gas - Yvan Le Borgne; Jean-François Marckert (CoRR, 2006)

On the Reduction of a Random Basis. - Ali Akhavi; Jean-François Marckert; Alain Rouault (ANALCO, 2007)

Directed Animals and Gas Models Revisited. - Yvan Le Borgne; Jean-François Marckert (Electron. J. Comb., 2007)

Quasi-optimal energy-efficient leader election algorithms in radio networks. - Christian Lavault; Jean-François Marckert; Vlady Ravelomanana (Inf. Comput., 2007)

The CRT is the scaling limit of unordered binary trees. - Jean-François Marckert; Grégory Miermont (Random Struct. Algorithms, 2011)

Directed Animals, Quadratic Systems and Rewriting Systems. - Jean-François Marckert (Electron. J. Comb., 2012)

Many Empty Triangles have a Common Edge. - Imre Bárány; Jean-François Marckert; Matthias Reitzner (Discret. Comput. Geom., 2013)

A natural stochastic extension of the sandpile model on a graph. - Yao-ban Chan; Jean-François Marckert; Thomas Selig (J. Comb. Theory A, 2013)

A new encoding of coalescent processes. Applications to the additive and multiplicative cases. - Nicolas Broutin; Jean-François Marckert (CoRR, 2014)

Asymptotics of trees with a prescribed degree sequence and applications. - Nicolas Broutin; Jean-François Marckert (Random Struct. Algorithms, 2014)

Election algorithms with random delays in trees. - Jean-François Marckert; Nasser Saheb-Djahromi; Akka Zemmari (CoRR, 2015)

A new combinatorial representation of the additive coalescent. - Jean-François Marckert; Minmin Wang (Random Struct. Algorithms, 2019)

The combinatorics of the colliding bullets. - Nicolas Broutin; Jean-François Marckert (Random Struct. Algorithms, 2020)

A combinatorial proof of Aldous-Broder theorem for general Markov chains. - Luis Fredes; Jean-François Marckert (Random Struct. Algorithms, 2023)