default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-François Marckert
Person information
- affiliation: Université Bordeaux 1, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Luis Fredes, Jean-François Marckert:
A combinatorial proof of Aldous-Broder theorem for general Markov chains. Random Struct. Algorithms 62(2): 430-449 (2023)- 2020
- [j13]Nicolas Broutin, Jean-François Marckert:
The combinatorics of the colliding bullets. Random Struct. Algorithms 56(2): 401-431 (2020)
2010 – 2019
- 2019
- [j12]Jean-François Marckert, Minmin Wang
:
A new combinatorial representation of the additive coalescent. Random Struct. Algorithms 54(2): 340-370 (2019) - 2015
- [i8]Jean-François Marckert, Nasser Saheb-Djahromi, Akka Zemmari:
Election algorithms with random delays in trees. CoRR abs/1507.04909 (2015) - 2014
- [j11]Nicolas Broutin, Jean-François Marckert:
Asymptotics of trees with a prescribed degree sequence and applications. Random Struct. Algorithms 44(3): 290-316 (2014) - [i7]Nicolas Broutin, Jean-François Marckert:
A new encoding of coalescent processes. Applications to the additive and multiplicative cases. CoRR abs/1409.4266 (2014) - 2013
- [j10]Imre Bárány, Jean-François Marckert, Matthias Reitzner:
Many Empty Triangles have a Common Edge. Discret. Comput. Geom. 50(1): 244-252 (2013) - [j9]Yao-ban Chan, Jean-François Marckert, Thomas Selig:
A natural stochastic extension of the sandpile model on a graph. J. Comb. Theory A 120(7): 1913-1928 (2013) - 2012
- [j8]Jean-François Marckert:
Directed Animals, Quadratic Systems and Rewriting Systems. Electron. J. Comb. 19(3): 45 (2012) - [i6]Yao-ban Chan, Jean-François Marckert, Thomas Selig:
A natural stochastic extension of the sandpile model on a graph. CoRR abs/1209.2038 (2012) - 2011
- [j7]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)
2000 – 2009
- 2007
- [j6]Yvan Le Borgne, Jean-François Marckert:
Directed Animals and Gas Models Revisited. Electron. J. Comb. 14(1) (2007) - [j5]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) - [c1]Ali Akhavi, Jean-François Marckert, Alain Rouault:
On the Reduction of a Random Basis. ANALCO 2007: 265-270 - 2006
- [i5]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) - [i4]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) - [i3]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) - [i2]Ali Akhavi, Jean-François Marckert, Alain Rouault:
On the reduction of a random basis. CoRR abs/math/0604331 (2006) - [i1]Yvan Le Borgne, Jean-François Marckert:
Directed animals in the gas. CoRR abs/math/0611194 (2006) - 2004
- [j4]Jean-François Marckert:
The rotation correspondence is asymptotically a dilatation. Random Struct. Algorithms 24(2): 118-132 (2004) - 2002
- [j3]Jean-François Marckert, Alois Panholzer:
Noncrossing trees are almost conditioned Galton-Watson trees. Random Struct. Algorithms 20(1): 115-125 (2002) - 2001
- [j2]Philippe Chassaing, Jean-François Marckert:
Parking Functions, Empirical Processes, and the Width of Rooted Labeled Trees. Electron. J. Comb. 8(1) (2001) - [j1]Jean-François Marckert:
Parking with density. Random Struct. Algorithms 18(4): 364-380 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
