Pages that link to "Item:Q1184999"
From MaRDI portal
The following pages link to Parallel chip firing games on graphs (Q1184999):
Displaying 21 items.
- A constant bound for the periods of parallel chip-firing games with many chips (Q707952) (← links)
- Parallel cleaning of a network with brushes (Q968165) (← links)
- Games on line graphs and sand piles (Q1261471) (← links)
- Parallel transient time of one-dimensional sand pile (Q1275077) (← links)
- No polynomial bound for the period of the parallel chip firing game on graphs (Q1349717) (← links)
- Universality of the chip-firing game (Q1392019) (← links)
- Source reversal and chip firing on graphs (Q1575961) (← links)
- Meeting covered elements in \(\nu\)-Tamari lattices (Q2070083) (← links)
- An exact bound on the number of chips of parallel chip-firing games that stabilize (Q2085558) (← links)
- Eric Goles (Q2086708) (← links)
- On fungal automata (Q2086749) (← links)
- On the limited increment parallel chip-firing game (Q2092410) (← links)
- Computational universality of fungal sandpile automata (Q2213185) (← links)
- Fixed-point forms of the parallel symmetric sandpile model (Q2446102) (← links)
- The chip-firing game (Q2575794) (← links)
- Parallel chip-firing on the complete graph: Devil’s staircase and Poincaré rotation number (Q3012886) (← links)
- Two sided Sand Piles Model and unimodal sequences (Q3526421) (← links)
- Some Halting Problems for Abelian Sandpiles Are Undecidable in Dimension Three (Q4555049) (← links)
- Abelian networks IV. Dynamics of nonhalting networks (Q5063346) (← links)
- Experimental research on the welfare in a closed production network (Q5134233) (← links)
- Motors and Impossible Firing Patterns in the Parallel Chip-Firing Game (Q5251658) (← links)
