Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire
RAIRO. Inform. théor., 19 2 (1985) 179-195
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
On the Edge‐Density of the Brownian Co‐Graphon and Common Ancestors of Pairs in the CRT
Guillaume ChapuyRandom Structures & Algorithms 66 (1) (2025)
https://doi.org/10.1002/rsa.21281
Simple random sampling of binary forests with fixed number of nodes and trees
Stoyan DimitrovTheoretical Computer Science 1051 115418 (2025)
https://doi.org/10.1016/j.tcs.2025.115418
Length spectrum of large genus random metric maps
Simon Barazer, Alessandro Giacchetto and Mingkun LiuForum of Mathematics, Sigma 13 (2025)
https://doi.org/10.1017/fms.2025.31
Maximum agreement subtrees and Hölder homeomorphisms between Brownian trees
Thomas Budzinski and Delphin SénizerguesJournal de l’École polytechnique — Mathématiques 11 395 (2024)
https://doi.org/10.5802/jep.256
A down‐up chain with persistent labels on multifurcating trees
Frederik SørensenRandom Structures & Algorithms 64 (2) 354 (2024)
https://doi.org/10.1002/rsa.21185
14764 43 (2024)
https://doi.org/10.1007/978-3-031-63021-7_4
Models of random subtrees of a graph
Luis Fredes and Jean-François MarckertProbability Surveys 20 (none) (2023)
https://doi.org/10.1214/23-PS22
Growing Random Uniform d-ary Trees
Jean-François MarckertAnnals of Combinatorics 27 (1) 51 (2023)
https://doi.org/10.1007/s00026-022-00621-3
Sampling planar tanglegrams and pairs of disjoint triangulations
Alexander E. Black, Kevin Liu, Alex McDonough, Garrett Nelson, Michael C. Wigal, Mei Yin and Youngho YooAdvances in Applied Mathematics 149 102550 (2023)
https://doi.org/10.1016/j.aam.2023.102550
(2023)
https://doi.org/10.2139/ssrn.4669248
The Foata–Fuchs proof of Cayley’s formula, and its probabilistic uses
Louigi Addario-Berry, Arthur Blanc-Renaudie, Serte Donderwinkel, Mickaël Maazoun and James B. MartinElectronic Communications in Probability 28 (none) (2023)
https://doi.org/10.1214/23-ECP523
Growing uniform planar maps face by face
Alessandra Caraceni and Alexandre StaufferRandom Structures & Algorithms 63 (4) 942 (2023)
https://doi.org/10.1002/rsa.21165
Stable graphs: distributions and line-breaking construction
Christina Goldschmidt, Bénédicte Haas and Delphin SénizerguesAnnales Henri Lebesgue 5 841 (2022)
https://doi.org/10.5802/ahl.138
An Efficient Sampling Algorithm for Difficult Tree Pairs
Sean Cleary and Roland MaioActa Cybernetica (2022)
https://doi.org/10.14232/actacyb.285522
On Stochastic Rewriting and Combinatorics via Rule-Algebraic Methods
Nicolas BehrElectronic Proceedings in Theoretical Computer Science 334 11 (2021)
https://doi.org/10.4204/EPTCS.334.2
Geometry of weighted recursive and affine preferential attachment trees
Delphin SénizerguesElectronic Journal of Probability 26 (none) (2021)
https://doi.org/10.1214/21-EJP640
Scaling limits of multi-type Markov Branching trees
Bénédicte Haas and Robin StephensonProbability Theory and Related Fields 180 (3-4) 727 (2021)
https://doi.org/10.1007/s00440-021-01064-2
Projections of the Aldous chain on binary trees: Intertwining and consistency
Noah Forman, Soumik Pal, Douglas Rizzolo and Matthias WinkelRandom Structures & Algorithms 57 (3) 745 (2020)
https://doi.org/10.1002/rsa.20930
A new family of bijections for planar maps
Baptiste LoufJournal of Combinatorial Theory, Series A 168 374 (2019)
https://doi.org/10.1016/j.jcta.2019.06.006
Practical Aspects of Declarative Languages
Paul TarauLecture Notes in Computer Science, Practical Aspects of Declarative Languages 11372 115 (2019)
https://doi.org/10.1007/978-3-030-05998-9_8
1203 (2018)
https://doi.org/10.1145/3167132.3167262
Scaling limits for some random trees constructed inhomogeneously
Nathan Ross and Yuting WenElectronic Journal of Probability 23 (none) (2018)
https://doi.org/10.1214/17-EJP101
Practical Aspects of Declarative Languages
Paul TarauLecture Notes in Computer Science, Practical Aspects of Declarative Languages 10702 116 (2018)
https://doi.org/10.1007/978-3-319-73305-0_8
XII Symposium of Probability and Stochastic Processes
Bénédicte HaasProgress in Probability, XII Symposium of Probability and Stochastic Processes 73 3 (2018)
https://doi.org/10.1007/978-3-319-77643-9_1
Doob–Martin boundary of Rémy’s tree growth chain
Steven N. Evans, Rudolf Grübel and Anton WakolbingerThe Annals of Probability 45 (1) (2017)
https://doi.org/10.1214/16-AOP1112
Local limits of Markov branching trees and their volume growth
Camille PagnardElectronic Journal of Probability 22 (none) (2017)
https://doi.org/10.1214/17-EJP96
Generalized gamma approximation with rates for urns, walks and trees
Erol A. Peköz, Adrian Röllin and Nathan RossThe Annals of Probability 44 (3) (2016)
https://doi.org/10.1214/15-AOP1010
Scaling limits of $k$-ary growing trees
Bénédicte Haas and Robin StephensonAnnales de l'Institut Henri Poincaré, Probabilités et Statistiques 51 (4) (2015)
https://doi.org/10.1214/14-AIHP622
An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes
Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz and Dominique BarthInformation Processing Letters 115 (2) 275 (2015)
https://doi.org/10.1016/j.ipl.2014.09.027
Handbook of Enumerative Combinatorics
Gilles SchaefferDiscrete Mathematics and Its Applications, Handbook of Enumerative Combinatorics 335 (2015)
https://doi.org/10.1201/b18255-8
Algebraic and Discrete Mathematical Methods for Modern Biology
Christian M. ReidysAlgebraic and Discrete Mathematical Methods for Modern Biology 347 (2015)
https://doi.org/10.1016/B978-0-12-801213-0.00014-9
Expected maximum vertex valence in pairs of polygonal triangulations
Timothy Chu and Sean ClearyInvolve, a Journal of Mathematics 8 (5) 763 (2015)
https://doi.org/10.2140/involve.2015.8.763
Shapes of topological RNA structures
Fenix W.D. Huang and Christian M. ReidysMathematical Biosciences 270 57 (2015)
https://doi.org/10.1016/j.mbs.2015.10.004
Increasing forests and quadrangulations via a bijective approach
Jérémie BettinelliJournal of Combinatorial Theory, Series A 122 107 (2014)
https://doi.org/10.1016/j.jcta.2013.10.003
Expected conflicts in pairs of rooted binary trees
Timothy Chu and Sean ClearyInvolve, a Journal of Mathematics 6 (3) 323 (2013)
https://doi.org/10.2140/involve.2013.6.323
A simple model of trees for unicellular maps
Guillaume Chapuy, Valentin Féray and Éric FusyJournal of Combinatorial Theory, Series A 120 (8) 2064 (2013)
https://doi.org/10.1016/j.jcta.2013.08.003
The stable trees are nested
Nicolas Curien and Bénédicte HaasProbability Theory and Related Fields 157 (3-4) 847 (2013)
https://doi.org/10.1007/s00440-012-0472-x
Simulating Size-constrained Galton–Watson Trees
Luc DevroyeSIAM Journal on Computing 41 (1) 1 (2012)
https://doi.org/10.1137/090766632
Counting unicellular maps on non-orientable surfaces
Olivier Bernardi and Guillaume ChapuyAdvances in Applied Mathematics 47 (2) 259 (2011)
https://doi.org/10.1016/j.aam.2010.09.001
Critical Random Graphs: Limiting Constructions and Distributional Properties
Louigi Addario-Berry, Nicolas Broutin and Christina GoldschmidtElectronic Journal of Probability 15 (none) (2010)
https://doi.org/10.1214/EJP.v15-772
Algorithms - ESA 2009
Johannes FischerLecture Notes in Computer Science, Algorithms - ESA 2009 5757 752 (2009)
https://doi.org/10.1007/978-3-642-04128-0_67
Regenerative tree growth: Binary self-similar continuum random trees and Poisson–Dirichlet compositions
Jim Pitman and Matthias WinkelThe Annals of Probability 37 (5) (2009)
https://doi.org/10.1214/08-AOP445
A unified approach to polynomial sequences with only real zeros
Lily L. Liu and Yi WangAdvances in Applied Mathematics 38 (4) 542 (2007)
https://doi.org/10.1016/j.aam.2006.02.003
The Narayana distribution
Robert A. SulankeJournal of Statistical Planning and Inference 101 (1-2) 311 (2002)
https://doi.org/10.1016/S0378-3758(01)00192-6
Bijective Recurrences for Motzkin Paths
Robert A. SulankeAdvances in Applied Mathematics 27 (2-3) 627 (2001)
https://doi.org/10.1006/aama.2001.0753
From Gene Trees to Species Trees
Bin Ma, Ming Li and Louxin ZhangSIAM Journal on Computing 30 (3) 729 (2000)
https://doi.org/10.1137/S0097539798343362
Three recurrences for parallelogram polyominoes
Robert A. Sulanke:Journal of Difference Equations and Applications 5 (2) 155 (1999)
https://doi.org/10.1080/10236199908808178
Uniform generation of a Schröder tree
L. Alonso, J.L. Rémy and R. SchottInformation Processing Letters 64 (6) 305 (1997)
https://doi.org/10.1016/S0020-0190(97)00174-9
A linear-time algorithm for the generation of trees
L. Alonso, J. L. Rémy and R. SchottAlgorithmica 17 (2) 162 (1997)
https://doi.org/10.1007/BF02522824
A Classic Proof of a Recurrence for a Very Classical Sequence
Dominique Foata and Doron ZeilbergerJournal of Combinatorial Theory, Series A 80 (2) 380 (1997)
https://doi.org/10.1006/jcta.1997.2814
A parallel algorithm for the generation of a permutation and applications
Laurent Alonso and René SchottTheoretical Computer Science 159 (1) 15 (1996)
https://doi.org/10.1016/0304-3975(95)00198-0
LATIN '95: Theoretical Informatics
L. Alonso and R. SchottLecture Notes in Computer Science, LATIN '95: Theoretical Informatics 911 16 (1995)
https://doi.org/10.1007/3-540-59175-3_78
Uniform generation of a Motzkin word
Laurent AlonsoTheoretical Computer Science 134 (2) 529 (1994)
https://doi.org/10.1016/0304-3975(94)00086-7
The generation of binary trees as a numerical problem
Renzo SprugnoliJournal of the ACM 39 (2) 317 (1992)
https://doi.org/10.1145/128749.128753
Automata, Languages and Programming
Y. MetivierLecture Notes in Computer Science, Automata, Languages and Programming 267 226 (1987)
https://doi.org/10.1007/3-540-18088-5_18