5 citations · 7 across the 9 of their papers we have counts for
9 papers
Random Deterministic Automata With One Added Transition
Arnaud Carayol, Philippe Duchon, Florent Koechlin +1
Every language recognized by a non-deterministic finite automaton can be recognized by a deterministic automaton, at the cost of a potential increase of the number of states, which…
On Order Types of Random Point Sets
Olivier Devillers, Philippe Duchon, Marc Glisse +1
A simple method to produce a random order type is to take the order type of a random point set. We conjecture that many probability distributions on order types defined in this way…
Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes
Olivier Bodini, Alice Jacquot, Philippe Duchon +1
Recent work of Brlek \textit{et al.} gives a characterization of digitally convex polyominoes using combinatorics on words. From this work, we derive a combinatorial symbolic descr…
Approximation Algorithms for Energy Minimization in Cloud Service Allocation under Reliability Constraints
Olivier Beaumont, Philippe Duchon, Paul Renaud-Goud
We consider allocation problems that arise in the context of service allocation in Clouds. More specifically, we assume on the one part that each computing resource is associated t…
Random generation of combinatorial structures: Boltzmann samplers and beyond
Philippe Duchon
The Boltzmann model for the random generation of "decomposable" combinatorial structures is a set of techniques that allows for efficient random sampling algorithms for a large cla…
Half-turn symmetric FPLs with rare couplings and tilings of hexagons
Jean-Christophe Aval, Philippe Duchon
In this work, we put to light a formula that relies the number of fully packed loop configurations (FPLs) associated to a given coupling pi to the number of half-turn symmetric FPL…