32 citations · 63 across the 20 of their papers we have counts for
3 papers · 1 filter
Linear-time generation of specifiable combinatorial structures: general theory and first examples
Frederique Bassino, Andrea Sportiello
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preproc…
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot +1
We present an algorithm running in time O(n ln n) which decides if a wreath-closed permutation class Av(B) given by its finite basis B contains a finite number of simple permutatio…
On the Average Complexity of Moore's State Minimization Algorithm
Frédérique Bassino, Julien David, Cyril Nicaud
We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moore's state…