Universality of the Chip-Firing Game
暂无分享,去创建一个
[1] Tang,et al. Self-Organized Criticality: An Explanation of 1/f Noise , 2011 .
[2] Eric Goles. Sand pile automata , 1992 .
[3] D. C. Cooper,et al. Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.
[4] Arthur Gill,et al. Linear sequential circuits : analysis, synthesis, and applications , 1966 .
[5] Eric Goles,et al. Sand Piles, Combinatorial Games and Cellular Automata , 1991 .
[6] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[7] Arthur Gill,et al. Linear sequential circuits , 1966 .
[8] Eric Goles Ch.,et al. Parallel Chip Firing Games on Graphs , 1992, Theor. Comput. Sci..
[9] Kimmo Eriksson,et al. Reachability is Decidable in the Numbers Game , 1994, Theor. Comput. Sci..
[10] László Lovász,et al. Chip-firing Games on Graphs , 1991, Eur. J. Comb..
[11] László Lovász,et al. Chip-Firing Games on Directed Graphs , 1992 .
[12] Eric Goles Ch.,et al. No Polynomial Bound for the Period of the Parallel Chip Firing Game on Graphs , 1994, Theor. Comput. Sci..
[13] J. Spencer,et al. Disks, balls, and walls: analysis of a combinatorial game , 1989 .
[14] Gábor Tardos,et al. Polynomial Bound for a Chip Firing Game on Graphs , 1988, SIAM J. Discret. Math..
[15] Marvin Minsky,et al. Computation : finite and infinite machines , 2016 .
[16] Kimmo Eriksson,et al. No polynomial bound for the chip firing game on directed graphs , 1991 .
[17] Eric Goles Ch.,et al. Games on Line Graphs and Sand Piles , 1993, Theor. Comput. Sci..
[18] Joel H. Spencer,et al. Balancing vectors in the max norm , 1986, Comb..