2 citations · 2 across the 11 of their papers we have counts for
15 papers
The Two-Dimensional Majority Rule is P-Complete
Pedro Montealegre, Martín Ríos-Wilson
We prove that prediction for the synchronous two-dimensional majority rule is -complete under logspace many-one reductions, resolving a problem open for almost three de…
On the complexity of freezing automata networks of bounded pathwidth
Eric Goles, Pedro Montealegre, Martín Ríos-Wilson +1
An automata network is a graph of entities, each holding a state from a finite set and evolving according to a local update rule which depends only on its neighbors in the network'…
Impact of (a)Synchronism on ECA: Towards a New Classification
Isabel Donoso-Leiva, Eric Goles, Martin Rios-Wilson +1
In this paper, we study the effect of (a)synchronism on the dynamics of elementary cellular automata. Within the framework of our study, we choose five distinct update schemes, sel…
The Hardness of Local Certification of Finite-State Dynamics
Diego Maldonado, Pedro Montealegre, Martín Ríos-Wilson
Finite-State Dynamics (FSD) is one of the simplest and constrained distributed systems. An FSD is defined by an -node network, with each node maintaining an internal state selec…
On elementary cellular automata asymptotic (a)synchronism sensitivity and complexity
Isabel Donoso Leiva, Eric Goles, Martín Ríos-Wilson +1
Among the fundamental questions in computer science is that of the impact of synchronism/asynchronism on computations, which has been addressed in various fields of the discipline:…
Local Certification of Majority Dynamics
Diego Maldonado, Pedro Montealegre, Martín Ríos-Wilson +1
In majority voting dynamics, a group of agents in a social network are asked for their preferred candidate in a future election between two possible choices. At each time step,…
Dynamical Stability of Threshold Networks over Undirected Signed Graphs
Eric Goles, Pedro Montealegre, Martín Ríos-Wilson +1
This paper, we explore the dynamics of threshold networks on undirected signed graphs. Much attention has been dedicated to understanding the convergence and long-term behavior of…
Intrinsic Simulations and Universality in Automata Networks
Martín Ríos-Wilson, Guillaume Theyssier
An automata network (AN) is a finite graph where each node holds a state from a finite alphabet and is equipped with a local map defining the evolution of the state of the node dep…
Computing Power of Hybrid Models in Synchronous Networks
Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes +3
During the last two decades, a small set of distributed computing models for networks have emerged, among which LOCAL, CONGEST, and Broadcast Congested Clique (BCC) play a prominen…
On the complexity of the generalized Q2R automaton
Eric Goles, Marco Montalva-Medel, Pedro Montealegre +1
We study the dynamic and complexity of the generalized Q2R automaton. We show the existence of non-polynomial cycles as well as its capability to simulate with the synchronous upda…
Generating Boolean Functions on Totalistic Automata Networks
Eric Goles, Andrew Adamatzky, Pedro Montealegre +1
We consider the problem of studying the simulation capabilities of the dynamics of arbitrary networks of finite states machines. In these models, each node of the network takes two…
On Symmetry versus Asynchronism: at the Edge of Universality in Automata Networks
Martín Ríos Wilson, Guillaume Theyssier
An automata network (AN) is a finite graph where each node holds a state from a finite alphabet and is equipped with a local map defining the evolution of the state of the node dep…
On the impact of treewidth in the computational complexity of freezing dynamics
Eric Goles, Pedro Montealegre, Martín Ríos-Wilson +1
An automata network is a network of entities, each holding a state from a finite set and evolving according to a local update rule which depends only on its neighbors in the networ…
On the Complexity of Asynchronous Freezing Cellular Automata
Eric Goles, Diego Maldonado, Pedro Montealegre +1
In this paper we study the family of freezing cellular automata (FCA) in the context of asynchronous updating schemes. A cellular automaton is called freezing if there exists an or…
On the effects of firing memory in the dynamics of conjunctive networks
Eric Goles, Pedro Montealegre, Martín Ríos Wilson
Boolean networks are one of the most studied discrete models in the context of the study of gene expression. In order to define the dynamics associated to a Boolean network, there…