P. Bak, C. Tang, and K. Wiesenfeld, noise, Physical Review Letters, vol.13, issue.4, pp.381-384, 1987.
DOI : 10.1103/PhysRevB.13.556

URL : https://hal.archives-ouvertes.fr/hal-01891317

A. Björner and L. Lovász, Chip-firing games on directed graphs, Journal of Algebraic Combinatorics, vol.1, issue.4, pp.305-328, 1992.
DOI : 10.1023/A:1022467132614

D. Dhar, The Abelian Sandpile and Related Models. Physica A Statistical Mechanics and its Applications 263, pp.4-25, 1999.
DOI : 10.1016/s0378-4371(98)00493-2

URL : http://arxiv.org/pdf/cond-mat/9808047v2.pdf

E. Formenti, E. Goles, and B. Martin, Computational complexity of avalanches in the kadanoff sandpile model, Fundamentae Informatica, vol.115, issue.1, pp.107-124, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01217125

E. Formenti, K. Perrot, and E. Rémila, Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles, Proceedings of AU- TOMATA'2014, pp.21-30, 2014.
DOI : 10.1007/978-3-319-18812-6_2

URL : https://hal.archives-ouvertes.fr/hal-01313306

E. Formenti, K. Perrot, and E. Rémila, Computational complexity of the avalanche problem for one dimensional decreasing sandpiles, Journal of Cellular Automata, vol.13, pp.215-228, 2018.
URL : https://hal.archives-ouvertes.fr/halshs-01417248

A. Gajardo and E. Goles, Crossing information in two-dimensional Sandpiles, Theoretical Computer Science, vol.369, issue.1-3, pp.463-469, 2006.
DOI : 10.1016/j.tcs.2006.09.022

E. Goles and M. Margenstern, Universality of the chip-firing game, Theoretical Computer Science, vol.172, issue.1-2, pp.121-134, 1997.
DOI : 10.1016/S0304-3975(95)00242-1

URL : https://doi.org/10.1016/s0304-3975(95)00242-1

E. Goles, P. Montealegre, K. Perrot, and G. Theyssier, On the complexity of twodimensional signed majority cellular automata, Journal of Computer and System Sciences, 2017.
DOI : 10.1016/j.jcss.2017.07.010

URL : https://hal.archives-ouvertes.fr/hal-01472161

E. Goles, P. Montealegre-barba, and I. Todinca, The complexity of the bootstraping percolation and other problems, Theoretical Computer Science, vol.504, pp.73-82, 2013.
DOI : 10.1016/j.tcs.2012.08.001

URL : https://hal.archives-ouvertes.fr/hal-00914603

J. A. Montoya and C. Mejía, On the Complexity of Sandpile Prediction Problems, Electronic Notes in Theoretical Computer Science, vol.252, pp.229-245, 2009.
DOI : 10.1016/j.entcs.2009.09.023

URL : https://doi.org/10.1016/j.entcs.2009.09.023

C. Moore and M. Nilsson, The computational complexity of sandpiles, Journal of Statistical Physics, vol.96, issue.1/2, pp.205-224, 1999.
DOI : 10.1023/A:1004524500416

G. Tardos, Polynomial Bound for a Chip Firing Game on Graphs, SIAM Journal on Discrete Mathematics, vol.1, issue.3, pp.397-398, 1988.
DOI : 10.1137/0401039