6 citations · 13 across the 21 of their papers we have counts for
3 papers · 1 filter
Computational complexity of the avalanche problem on one dimensional Kadanoff sandpiles
Enrico Formenti, Kévin Perrot, Eric Rémila
In this paper we prove that the general avalanche problem AP is in NC, for the Kadanoff sandpile model in one dimension, answering an open problem of Formenti, Goles and Martin in…
Linearity is Strictly More Powerful than Contiguity for Encoding Graphs
Christophe Crespelle, Tien-Nam Le, Kevin Perrot +1
Linearity and contiguity are two parameters devoted to graph encoding. Linearity is a generalisation of contiguity in the sense that every encoding achieving contiguity induces…
A framework for (de)composing with Boolean automata networks
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
Boolean automata networks (BANs) are a generalisation of Boolean cellular automata. In such, any theorem describing the way BANs compute information is a strong tool that can be ap…