Universality of the chip-firing game

Theoretical Computer Science

Volumn 172, Issue 1-2, 1997, Pages 121-134

  Goles, Eric ^a   Margenstern, Maurice ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; GRAPH THEORY; ITERATIVE METHODS; NUMERICAL METHODS; SHIFT REGISTERS;

CHIP FIRING GAME; REACHABILITY PROBLEM; UNIVERSALITY;

GAME THEORY;

EID: 0031074031     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(95)00242-1     Document Type: Article

References (18)

1. R.J. Anderson, L. Lovasz, P. Shor, J. Spencer, E. Tardos and S. Winograd, Disk balls and walls: analysis of a combinatorial game, Amer. Math. Monthly 96 (1989) 481-493.
2. P. Back, Ch. Tang and K. Wiesenfeld, Self organized critically: an explanation of 1/f noise, Phys. Rev. Lett. 59 (1987) 381-384.
3. J. Bitar and E. Goles, Parallel chip-firing game on graphs, Theor. Comput. Sci. 92 (1992) 291-300.
4. A. Björner and L. Lovasz, Chip firing games on directed graphs, J. Alg. Combin, 1 (1992) 305-328.
5. A. Björaer, L. Lovasz and P. Shor, Chip firing games on graphs, Eur. J. Combin. 12 (1991) 283-291.
6. K. Eriksson, No polynomial bound for the chip-firing game on directed graphs, Proc. Amer. Math. Soc. 112 (1991) 1203-1205.
7. K. Eriksson, Reachability is decidable in the numbers game, Theor. Comput. Sci. 131 (1994) 431-439.
8. A. Gill, Linear Sequential Circuits, Analysis, Sintesis and Applications, Mc-Graw Hill Series in Systems Sciences (1966).
9. E. Goles, Sand piles, combinatorial games and cellular automata, in: Tirapegui et al. eds., Proc. Instabilities and nonequilibrium structures-III (Kluwer, Dordrecht, 1991).
10. E. Goles, Sand pile automata, Ann. Inst. H. Poincaré, Phys. Théor 56 (1992) 75-90.
11. E. Goles and M. Kiwi, Games on line graphs sand piles, Theor. Comput. Sci. 115 (1993) 321-349.
12. E. Goles and M. Margenstern, Universality of the parallel chip-firing game and related results, Research Report LITP 95/33, 1995.
13. M. Kiwi, R. Ndoundam, M. Tchuente and E. Goles, No polynomial bound for the period of the parallel chip-firing game on graphs, Theor. Comput. Sci. 136 (1994) 527-532.
14. L.M. Minsky, Computation: finite and Infinite Machines (Prentice-Hall, Englewood Cliffs, NJ, 1967).
15. E. Prisner, Parallel chip-firing games on digraphs, Tech. Report Mathematisches Seminar, Universität Hamburg, Nov. 1994, Complex Systems, to appear.
16. H. Rogers, Theory of Recursive Functions and Effective Computability (McGraw-Hill, New York, 1967).
17. J. Spencer, Balancing vectors in the max norm, Combinatorica 6 (1986) 55-66.
18. G. Tardos, Polynomial bound for a chip-firing game on graphs, SIAM J. Discrete Math. 1 (1988) 397-398.