H. Akbari and P. Berenbrink, Parallel rotor walks on finite graphs and applications in discrete load balancing, Proceedings of the 25th ACM symposium on Parallelism in algorithms and architectures, SPAA '13, pp.186-195, 2013.
DOI : 10.1145/2486159.2486178

D. Aldous and J. Fill, Reversible markov chains and random walks on graphs, 2001.

N. Alon, C. Avin, M. Kouck´ykouck´y, G. Kozma, Z. Lotker et al., Many Random Walks Are Faster Than One, Combinatorics, Probability and Computing, vol.47, issue.04, pp.481-502, 2011.
DOI : 10.1017/S0963548398003538

E. Bampas, L. Gasieniec, N. Hanusse, D. Ilcinkas, R. Klasing et al., Euler Tour Lock-In Problem in the Rotor-Router Model, DISC, pp.423-435, 2009.
DOI : 10.1007/978-3-642-04355-0_44
URL : https://hal.archives-ouvertes.fr/hal-00402749

P. Berenbrink, C. Cooper, T. Friedetzky, T. Friedrich, and T. Sauerwald, Randomized diffusion for indivisible loads, SIAM, pp.429-439, 2011.

J. N. Cooper, B. Doerr, J. H. Spencer, and G. Tardos, Deterministic random walks on the integers, European Journal of Combinatorics, vol.28, issue.8, pp.2072-2090, 2007.
DOI : 10.1016/j.ejc.2007.04.018
URL : https://hal.archives-ouvertes.fr/hal-01184393

D. Dereniowski, A. Kosowski, D. Pajak, and P. Uznanski, Bounds on the cover time of parallel rotor walks, STACS Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.263-275, 2014.
DOI : 10.1016/j.jcss.2016.01.004
URL : https://hal.archives-ouvertes.fr/hal-00865065

B. Doerr and T. Friedrich, Deterministic Random Walks on the Two-Dimensional Grid, Combinatorics, Probability and Computing, vol.49, issue.1-2, pp.123-144, 2009.
DOI : 10.1017/S0963548306007565

K. Efremenko and O. Reingold, How well do random walks parallelize? In APPROX-RANDOM, pp.476-489, 2009.

R. Elsässer and T. Sauerwald, Tight bounds for the cover time of multiple random walks, LNCS, vol.1, issue.5555, pp.415-426, 2009.

R. Elsässer and T. Sauerwald, Tight bounds for the cover time of multiple random walks, Theoretical Computer Science, vol.412, issue.24, pp.2623-2641, 2011.
DOI : 10.1016/j.tcs.2010.08.010

T. Friedrich, M. Gairing, and T. Sauerwald, Quasirandom Load Balancing, SIAM Journal on Computing, vol.41, issue.4, pp.747-771, 2012.
DOI : 10.1137/100799216

S. Kijima, K. Koga, and K. Makino, Deterministic random walks on finite graphs, ANALCO, pp.18-27, 2012.

R. Klasing, A. Kosowski, D. Pajak, and T. Sauerwald, The multi-agent rotor-router on the ring, Proceedings of the 2013 ACM symposium on Principles of distributed computing, PODC '13, pp.365-374, 2013.
DOI : 10.1145/2484239.2484260
URL : https://hal.archives-ouvertes.fr/hal-00735113

D. A. Levin, Y. Peres, and E. L. Wilmer, Markov chains and mixing times, 2006.
DOI : 10.1090/mbk/058

V. Priezzhev, D. Dhar, A. Dhar, and S. Krishnamurthy, Eulerian Walkers as a Model of Self-Organized Criticality, Physical Review Letters, vol.77, issue.25, pp.5079-5082, 1996.
DOI : 10.1103/PhysRevLett.77.5079

Y. Rabani, A. Sinclair, and R. Wanka, Local divergence of Markov chains and the analysis of iterative load-balancing schemes, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.694-705, 1998.
DOI : 10.1109/SFCS.1998.743520

V. Yanovski, I. A. Wagner, and A. M. Bruckstein, A Distributed Ant Algorithm for\protect Efficiently Patrolling a Network, Algorithmica, vol.15, issue.1/4, pp.165-186, 2003.
DOI : 10.1007/s00453-003-1030-9