32 citations · 135 across the 28 of their papers we have counts for
3 papers · 1 filter
Some families of trees arising in permutation analysis
Mathilde Bouvel, Marni Mishna, Cyril Nicaud
We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by geno…
Analysis of Algorithms for Permutations Biased by Their Number of Records
Nicolas Auger, Mathilde Bouvel, Cyril Nicaud +1
The topic of the article is the parametric study of the complexity of algorithms on arrays of pairwise distinct integers. We introduce a model that takes into account the non-unifo…
The Brownian limit of separable permutations
Frédérique Bassino, Mathilde Bouvel, Valentin Féray +2
We study random uniform permutations in an important class of pattern-avoiding permutations: the separable permutations. We describe the asymptotics of the number of occurrences of…