Y. Afek and E. Gafni, Distributed Algorithms For Unidirectional Networks, SIAM Journal on Computing, vol.23, issue.6, pp.1152-1178, 1994.
DOI : 10.1137/S009753979223277X
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.1428

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

E. Bampas, L. , 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

E. Bampas, L. , R. Klasing, A. Kosowski, and T. Radzik, Robustness of the rotorrouter mechanism, OPODIS, pp.345-358, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00417639

P. Berenbrink, R. Klasing, A. Kosowski, F. Mallmann-trenn, and P. Uzna´nskiuzna´nski, Improved Analysis of Deterministic Load-Balancing Schemes, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC '15, pp.301-310, 2015.
DOI : 10.1145/2767386.2767413
URL : https://hal.archives-ouvertes.fr/hal-01251847

S. N. Bhatt, S. Even, D. S. Greenberg, and R. Tayar, Traversing Directed Eulerian Mazes, Journal of Graph Algorithms and Applications, vol.6, issue.2, pp.157-173, 2002.
DOI : 10.7155/jgaa.00049
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.6627

J. N. Cooper and J. Spencer, Simulating a Random Walk with Constant Error, Combinatorics, Probability and Computing, vol.15, issue.06, pp.815-822, 2006.
DOI : 10.1017/S0963548306007565

D. Dereniowski, A. Kosowski, D. Paj, ?. , and P. Uzna´nskiuzna´nski, Bounds on the cover time of parallel rotor walks, STACS, volume 25 of LIPIcs, 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

T. Friedrich, T. L. Sauerwald-12, and T. Radzik, The cover time of deterministic random walks Memory efficient anonymous graph exploration, COCOON WG, pp.130-139, 2008.

M. Kiwi, R. Ndoundam, M. Tchuente, and E. Goles, No polynomial bound for the period of the parallel chip firing game on graphs, Theoretical Computer Science, vol.136, issue.2, pp.527-532, 1994.
DOI : 10.1016/0304-3975(94)00131-2

R. Klasing, A. Kosowski, D. Paj, ?. , 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

E. Landau, Uber die maximalordnung der permutationen gegebenen grades, Arch. Math. Phys, vol.5, pp.92-103, 1903.

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-703, 1998.
DOI : 10.1109/SFCS.1998.743520

T. Sauerwald and H. Sun, Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp.341-350, 2012.
DOI : 10.1109/FOCS.2012.86

T. Shiraga, Y. Yamauchi, S. Kijima, and M. Yamashita, L ?????????-Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains, COCOON 2014, pp.25-36, 2014.
DOI : 10.1007/978-3-319-08783-2_3

I. A. Wagner, M. Lindenbaum, and A. M. Bruckstein, Distributed covering by ant-robots using evaporating traces, IEEE Transactions on Robotics and Automation, vol.15, issue.5, pp.918-933, 1999.
DOI : 10.1109/70.795795
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.9988

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