On the complexity of sandpile critical avalanches

DOI10.1016/j.tcs.2011.02.029zbMath1216.68132OpenAlexW2015270819MaRDI QIDQ549714

Carolina Mejia, Juan Andrés Montoya

Publication date: 18 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.029

zbMATH Keywords

parallel algorithmsself-organized criticalityabelian sandpile modelP-complete problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

On the predictability of the abelian sandpile model ⋮ Optimal simulation of sandcastle life in dynamic environment based on stability principle ⋮ Abelian Networks I. Foundations and Examples ⋮ Abelian Logic Gates

Cites Work

• On the sandpile group of regular trees
• The computational complexity of sandpiles
• The computational complexity of one-dimensional sandpiles
• On the Complexity of Sandpile Prediction Problems
• Self-organized criticality
• Polynomial Bound for a Chip Firing Game on Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of sandpile critical avalanches