Sandpiles prediction and crossover on within Moore neighborhood

P Concha-Vega, E Goles, P Montealegre, K Perrot - Natural Computing, 2024 - Springer
The computational complexity of predicting sandpiles on Z 2 is not settled yet, neither for von
Neumann nor for Moore neighborhood (is it in NC? is it P-complete?). In this work we study …

How hard is it to predict sandpiles on lattices? A survey

E Formenti, K Perrot - Fundamenta Informaticae, 2020 - content.iospress.com
Since their introduction in the 80s, sandpile models have raised interest for their simple
definition and their surprising dynamical properties. In this survey we focus on the …

Sandpile toppling on Penrose tilings: identity and isotropic dynamics

J Fersula, C Noûs, K Perrot - … and Complexity: Essays Presented to Eric …, 2022 - Springer
We present experiments of sandpiles on grids (square, triangular, hexagonal) and Penrose
tilings. The challenging part is to program such simulator; and our javacript code is available …

Non uniform cellular automata description of signed partition versions of ice and sand pile models

G Cattaneo, G Chiaselotti, A Dennunzio… - … Conference on Cellular …, 2014 - Springer
This paper reviews the well-known formalisations for ice and sand piles, based on a finite
sequence of non-negative integers and its recent extension to signed partitions, ie …

Computational complexity of the avalanche problem on one dimensional kadanoff sandpiles

E Formenti, K Perrot, É Rémila - … , AUTOMATA 2014, Himeji, Japan, July 7 …, 2015 - Springer
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 [2]. Thus adding one more …

Any shape can ultimately cross information on two-dimensional abelian sandpile models

VH Nguyen, K Perrot - Cellular Automata and Discrete Complex Systems …, 2018 - Springer
We study the abelian sandpile model on the two-dimensional grid with uniform
neighborhood (a number-conserving cellular automata), and prove that any family of …

Computational Complexity of the Avalanche Problem for One Dimensional Decreasing Sandpiles.

E Formenti, K Perrot, E Rémila - Journal of Cellular Automata, 2018 - search.ebscohost.com
In this paper we prove that the general avalanche problem AP is in NC for all decreasing
sandpile models in one dimension. It extends the developments of [5], and requires a careful …

[PDF][PDF] Sandpiles prediction and crossover on ℤ2 within Moore neighborhood

P Concha-Vega, E Goles, P Montealegre, K Perrot - 2024 - scholar.archive.org
The computational complexity of predicting sandpiles on Z2 is not settled yet, neither for von
Neumann nor for Moore neighborhood (is it in NC? is it P-complete?). In this work we study …

Eric Goles

A Adamatzky - Automata and Complexity: Essays Presented to Eric …, 2022 - Springer
Eric Goles | SpringerLink Skip to main content Advertisement SpringerLink Account Menu Find
a journal Publish with us Track your research Search Cart Book cover Automata and …

Les piles de sable Kadanoff

K Perrot - 2013 - theses.hal.science
Les modèles de pile de sable sont une sous-classe d'automates cellulaires. Bak et al. les
ont introduit en 1987 comme une illustration de la notion intuitive d'auto-organisation …