D. Aldous and J. A. , Reversible Markov Chains and Random Walks on Graphs, 1995.

R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovasz, and C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pp.218-223, 1979.
DOI : 10.1109/SFCS.1979.34

N. Alon, C. Avin, M. Kouck´ykouck´y, G. Kozma, Z. Lotker et al., Many random walks are faster than one, SPAA, pp.119-128, 2008.

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

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

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

C. Cooper, D. Ilcinkas, R. Klasing, and A. Kosowski, Derandomizing random walks in undirected graphs using locally fair exploration strategies, Distributed Computing, vol.37, issue.3, pp.91-99, 2011.
DOI : 10.1007/s00446-011-0138-4

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

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

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, LNCS, vol.5687, 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.

P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc, and D. Peleg, Graph exploration by a finite automaton, Theoretical Computer Science, vol.345, issue.2-3, pp.331-344, 2005.
DOI : 10.1016/j.tcs.2005.07.014

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

T. Friedrich and T. Sauerwald, The Cover Time of Deterministic Random Walks, COCOON, pp.130-139, 2010.
DOI : 10.1007/978-3-642-14031-0_16

L. Gasieniec and T. Radzik, Memory Efficient Anonymous Graph Exploration, WG, pp.14-29, 2008.
DOI : 10.1137/0405007

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

L. Lovász and P. Winkler, A note on the last new vertex visited by a random walk, Journal of Graph Theory, vol.50, issue.5, pp.593-596, 1993.
DOI : 10.1002/jgt.3190170505

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

O. Reingold, Undirected connectivity in log-space, Journal of the ACM, vol.55, issue.4, 2008.
DOI : 10.1145/1391289.1391291

T. Sauerwald, Expansion and the cover time of parallel random walks, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.315-324, 2010.
DOI : 10.1145/1835698.1835776

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

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