International audienceWe study the complexity of the majority rule on planar automata networks. We reduce a special case of the Monotone Circuit Value Problem to the prediction problem of determining if a vertex of a planar graph will change its state when the network is updated with the majority rule
Cellular automata have been mainly studied on very regular graphs carrying the vertices (like lines ...
We study the complexity of several of the classical graph decision problems in the setting of bounde...
AbstractWe prove an exponential lower bound for the majority function on constant depth monotone cir...
International audienceWe study the complexity of signed majority cellular automata on the planar gri...
Artículo de publicación ISIWe study the dynamics of majority automata networks when the vertices are...
© 2014 Elsevier B.V. Given a threshold automata network, as well as an updating scheme over its vert...
Abstract. We study here the problem of determining the majority type in an arbitrary connected netwo...
AbstractIn a graph theoretical model of the spread of fault in distributed computing and communicati...
Part 2: Regular PapersInternational audienceConsider a two dimensional lattice with the von Neumann ...
We focus on the majority rule (MR) applied on heterogeneous networks. When the underlying topology i...
We study here the problem of determining the majority type in an arbitrary connected network, each v...
Imagine a network wherein nodes are arranged in a loop and each node is connected to receive data fr...
We consider a system in which a group of agents represented by the vertices of a graph synchronously...
AbstractThis paper is a contribution to the study of the general problem of characterizing those pro...
We first present a protocol to elect a unique leader of a given cycle of the planar square lattice o...
Cellular automata have been mainly studied on very regular graphs carrying the vertices (like lines ...
We study the complexity of several of the classical graph decision problems in the setting of bounde...
AbstractWe prove an exponential lower bound for the majority function on constant depth monotone cir...
International audienceWe study the complexity of signed majority cellular automata on the planar gri...
Artículo de publicación ISIWe study the dynamics of majority automata networks when the vertices are...
© 2014 Elsevier B.V. Given a threshold automata network, as well as an updating scheme over its vert...
Abstract. We study here the problem of determining the majority type in an arbitrary connected netwo...
AbstractIn a graph theoretical model of the spread of fault in distributed computing and communicati...
Part 2: Regular PapersInternational audienceConsider a two dimensional lattice with the von Neumann ...
We focus on the majority rule (MR) applied on heterogeneous networks. When the underlying topology i...
We study here the problem of determining the majority type in an arbitrary connected network, each v...
Imagine a network wherein nodes are arranged in a loop and each node is connected to receive data fr...
We consider a system in which a group of agents represented by the vertices of a graph synchronously...
AbstractThis paper is a contribution to the study of the general problem of characterizing those pro...
We first present a protocol to elect a unique leader of a given cycle of the planar square lattice o...
Cellular automata have been mainly studied on very regular graphs carrying the vertices (like lines ...
We study the complexity of several of the classical graph decision problems in the setting of bounde...
AbstractWe prove an exponential lower bound for the majority function on constant depth monotone cir...
DOI
Add to ORKG