 | 2011 |
|---|
| 12 |       | Jean-François Marckert,
Grégory Miermont:
The CRT is the scaling limit of unordered binary trees.
Random Struct. Algorithms 38(4): 467-501 (2011) |
| 2007 |
|---|
| 11 | | Yvan Le Borgne,
Jean-François Marckert:
Directed Animals and Gas Models Revisited.
Electr. J. Comb. 14(1): (2007) |
| 10 | | Christian Lavault,
Jean-François Marckert,
Vlady Ravelomanana:
Quasi-optimal energy-efficient leader election algorithms in radio networks.
Inf. Comput. 205(5): 679-693 (2007) |
| 2006 |
|---|
| 9 | | Christian Lavault,
Jean-François Marckert,
Vlady Ravelomanana:
A Quasi-Optimal Leader Election Algorithm in Radio Networks with Log-Logarithmic Awake Time Slots
CoRR abs/cs/0607028: (2006) |
| 8 | | Christian Lavault,
Jean-François Marckert,
Vlady Ravelomanana:
Quasi-Optimal Leader Election Algorithms in Radio Networks with Loglogarithmic Awake Time Slots
CoRR abs/cs/0607034: (2006) |
| 7 | | Jean-Maxime Labarbe,
Jean-François Marckert:
Asymptotics of Bernoulli random walks, bridges, excursions and meanders with a given number of peaks
CoRR abs/math/0601624: (2006) |
| 6 | | Ali Akhavi,
Jean-François Marckert,
Alain Rouault:
On the reduction of a random basis
CoRR abs/math/0604331: (2006) |
| 5 | | Yvan Le Borgne,
Jean-François Marckert:
Directed animals in the gas
CoRR abs/math/0611194: (2006) |
| 2004 |
|---|
| 4 | | Jean-François Marckert:
The rotation correspondence is asymptotically a dilatation.
Random Struct. Algorithms 24(2): 118-132 (2004) |
| 2002 |
|---|
| 3 | | Jean-François Marckert,
Alois Panholzer:
Noncrossing trees are almost conditioned Galton-Watson trees.
Random Struct. Algorithms 20(1): 115-125 (2002) |
| 2001 |
|---|
| 2 | | Philippe Chassaing,
Jean-François Marckert:
Parking Functions, Empirical Processes, and the Width of Rooted Labeled Trees.
Electr. J. Comb. 8(1): (2001) |
| 1 | | Jean-François Marckert:
Parking with density.
Random Struct. Algorithms 18(4): 364-380 (2001) |
Data released under the ODC-BY 1.0 license — See also our legal information page