4 citations · 11 across the 8 of their papers we have counts for
9 papers
Dynamics of extended Schelling models
A. P. Vieira, E. Goles, H. J. Herrmann
We explore extensions of Schelling's model of social dynamics, in which two types of agents live on a checkerboard lattice and move in order to optimize their own satisfaction, whi…
Traced communication complexity of cellular automata
Eric Goles, Pierre Guillon, Ivan Rapaport
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state of…
Computational Complexity of Avalanches in the Kadanoff two-dimensional Sandpile Model
Eric Goles Chacc, Bruno Martin
In this paper we prove that the avalanche problem for Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circuit v…
Communication Complexity and Intrinsic Universality in Cellular Automata
Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rapaport +1
The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains…
Communications in cellular automata
Eric Goles, Pierre-Etienne Meunier, Ivan Rapaport +1
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic pr…
Complexity of Langton's Ant
Anahi Gajardo, Andres Moreira, Eric Goles
The virtual ant introduced by C. Langton has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate any boolean circuit with…