5 citations · 5 across the 2 of their papers we have counts for
4 papers
Faster and Enhanced Inclusion-Minimal Cograph Completion
Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan +1
We design two incremental algorithms for computing an inclusion-minimal completion of an arbitrary graph into a cograph. The first one is able to do so while providing an additiona…
Applying causality principles to the axiomatization of probabilistic cellular automata
Pablo Arrighi, Renan Fargetton, Vincent Nesme +1
Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by…
Stochastic Minority on Graphs
Jean-Baptiste Rouquier, Damien Regnault, Eric Thierry1
Cellular automata have been mainly studied on very regular graphs carrying the vertices (like lines or grids) and under synchronous dynamics (all vertices update simultaneously). I…
Progresses in the Analysis of Stochastic 2D Cellular Automata: a Study of Asynchronous 2D Minority
Damien Regnault, Nicolas Schabanel, Éric Thierry
Cellular automata are often used to model systems in physics, social sciences, biology that are inherently asynchronous. Over the past 20 years, studies have demonstrated that the…