We stand with Ukraine  

Jean-François Marckert

Affiliations:
  • Université Bordeaux 1, France


According to our database1, Jean-François Marckert authored at least 21 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A combinatorial proof of Aldous-Broder theorem for general Markov chains.
[BibTeX]
[DOI]
Luis Fredes
,
Jean-François Marckert
Random Struct. Algorithms, March, 2023

2020
The combinatorics of the colliding bullets.
[BibTeX]
[DOI]
Nicolas Broutin
,
Jean-François Marckert
Random Struct. Algorithms, 2020

2019
A new combinatorial representation of the additive coalescent.
[BibTeX]
[DOI]
Jean-François Marckert
,
Minmin Wang
Random Struct. Algorithms, 2019

2015
Election algorithms with random delays in trees.
[BibTeX]
[DOI]
Jean-François Marckert
,
Nasser Saheb-Djahromi
,
Akka Zemmari
CoRR, 2015

2014
Asymptotics of trees with a prescribed degree sequence and applications.
[BibTeX]
[DOI]
Nicolas Broutin
,
Jean-François Marckert
Random Struct. Algorithms, 2014

A new encoding of coalescent processes. Applications to the additive and multiplicative cases.
[BibTeX]
[DOI]
Nicolas Broutin
,
Jean-François Marckert
CoRR, 2014

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

Many Empty Triangles have a Common Edge.
[BibTeX]
[DOI]
Imre Bárány
,
Jean-François Marckert
,
Matthias Reitzner
Discret. Comput. Geom., 2013

2012
Directed Animals, Quadratic Systems and Rewriting Systems.
[BibTeX]
[DOI]
Jean-François Marckert
Electron. J. Comb., 2012

2011
The CRT is the scaling limit of unordered binary trees.
[BibTeX]
[DOI]
Jean-François Marckert
,
Grégory Miermont
Random Struct. Algorithms, 2011

2007
Quasi-optimal energy-efficient leader election algorithms in radio networks.
[BibTeX]
[DOI]
Christian Lavault
,
Jean-François Marckert
,
Vlady Ravelomanana
Inf. Comput., 2007

Directed Animals and Gas Models Revisited.
[BibTeX]
[DOI]
Yvan Le Borgne
,
Jean-François Marckert
Electron. J. Comb., 2007

On the Reduction of a Random Basis.
[BibTeX]
[DOI]
Ali Akhavi
,
Jean-François Marckert
,
Alain Rouault
Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, 2007

2006
Directed animals in the gas
[BibTeX]
[DOI]
Yvan Le Borgne
,
Jean-François Marckert
CoRR, 2006

Asymptotics of Bernoulli random walks, bridges, excursions and meanders with a given number of peaks
[BibTeX]
[DOI]
Jean-Maxime Labarbe
,
Jean-François Marckert
CoRR, 2006

Quasi-Optimal Leader Election Algorithms in Radio Networks with Loglogarithmic Awake Time Slots
[BibTeX]
[DOI]
Christian Lavault
,
Jean-François Marckert
,
Vlady Ravelomanana
CoRR, 2006

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

2004
The rotation correspondence is asymptotically a dilatation.
[BibTeX]
[DOI]
Jean-François Marckert
Random Struct. Algorithms, 2004

2002
Noncrossing trees are almost conditioned Galton-Watson trees.
[BibTeX]
[DOI]
Jean-François Marckert
,
Alois Panholzer
Random Struct. Algorithms, 2002

2001
Parking with density.
[BibTeX]
[DOI]
Jean-François Marckert
Random Struct. Algorithms, 2001

Parking Functions, Empirical Processes, and the Width of Rooted Labeled Trees.
[BibTeX]
[DOI]
Philippe Chassaing
,
Jean-François Marckert
Electron. J. Comb., 2001


  Loading...