-
Generating random alternating permutations in time $n\log n$
We introduce an algorithm generating uniformly distributed random alternating permutations of length $n$ in time $n\log n$. -
Combinatorial specification of permutation classes
International audience -
The weighted words collector
International audience -
Flexible RNA design under structure and sequence constraints using formal lan...
International audience -
Just how dense are dense graphs in the real world? A methodological note
International audience -
A Calculus for the Random Generation of Labelled Combinatorial Structures
International audience -
Permutations with a prescribed descent set
We give a formula to compute the number of permutations with a prescribed descent set in quadratic time. We give the generating function of the number of permutations... -
Unranking of unlabelled decomposable structures
Colloque avec actes et comité de lecture. -
Random Sampling of Large Planar Maps and Convex Polyhedra
Colloque avec actes et comité de lecture. -
Shuffling biological sequencess with motifs constraints
Colloque avec actes et comité de lecture. internationale.
