1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.CG2019
An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting
Xavier Goaoc, Andreas Holmsen, Cyril Nicaud
We study the problem of deciding if a given triple of permutations can be realized as geometric permutations of disjoint convex sets in . We show that this question,…
cs.DM2016
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…
cs.DS2009★ 1 cited
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…