Universality of the chip-firing game
From MaRDI portal
Publication:1392019
DOI10.1016/S0304-3975(95)00242-1zbMath0903.68138OpenAlexW1975223568MaRDI QIDQ1392019
Maurice Margenstern, Eric Goles Chacc
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(95)00242-1
Related Items (16)
Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models ⋮ Parallel rank of two sandpile models of signed integer partitions ⋮ Abelian networks IV. Dynamics of nonhalting networks ⋮ Crossing information in two-dimensional sandpiles ⋮ A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton ⋮ On Goles' universal machines: a computational point of view ⋮ Sand piles models of signed partitions with \(d\) piles ⋮ Computational universality of fungal sandpile automata ⋮ Generalized communicating P systems ⋮ Freezing sandpiles and Boolean threshold networks: equivalence and complexity ⋮ Eric Goles ⋮ Structure of some sand piles model ⋮ Abelian Networks I. Foundations and Examples ⋮ Sandpile toppling on Penrose tilings: identity and isotropic dynamics ⋮ On fungal automata ⋮ Motors and Impossible Firing Patterns in the Parallel Chip-Firing Game
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chip-firing games on directed graphs
- Chip-firing games on graphs
- Balancing vectors in the max norm
- Parallel chip firing games on graphs
- Games on line graphs and sand piles
- Reachability is decidable in the numbers game
- No polynomial bound for the period of the parallel chip firing game on graphs
- Disks, Balls, and Walls: Analysis of a Combinatorial Game
- Polynomial Bound for a Chip Firing Game on Graphs
- No Polynomial Bound for the Chip Firing Game on Directed Graphs
This page was built for publication: Universality of the chip-firing game
