Polynomial bound for a chip firing game on graphs

Algorithmic Aspects of a Chip-Firing Game

Combinatorics, Probability and Computing

On the sandpile group of regular trees

European Journal of Combinatorics

Sandpile transience on the grid is polynomially bounded

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

On the Complexity of Sandpile Prediction Problems

Electronic Notes in Theoretical Computer Science (ENTCS)

The complexity of three-dimensional critical avalanches

ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry

On the complexity of sandpile critical avalanches

Theoretical Computer Science

Random walks, electric networks and the transience class problem of sandpiles

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms

Chip-firing games, potential theory on graphs, and spanning trees

Journal of Combinatorial Theory Series A

Computing with sand: on the complexity of recognizing two-dimensional sandpile critical configurations

UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation