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

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. A. Fill, Reversible markov chains and random walks on graphs, 2002.

C. Ambühl, L. Gasieniec, A. Pelc, T. Radzik, and X. Zhang, Tree exploration with logarithmic memory, ACM Transactions on Algorithms, vol.7, issue.2, p.17, 2011.
DOI : 10.1145/1921659.1921663

M. A. Bender, A. Fernández, D. Ron, A. Sahai, and S. P. Vadhan, The power of a pebble, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.1-21, 2002.
DOI : 10.1145/276698.276759

P. Berenbrink, R. Klasing, A. Kosowski, F. Mallmann-trenn, and P. Uznanski, 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

J. Chalopin, S. Das, P. Gawrychowski, A. Kosowski, A. Labourel et al., Lock-in problem for parallel rotor-router walks, p.3200, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01021930

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

X. Deng and C. H. Papadimitriou, Exploring an unknown graph, Journal of Graph Theory, vol.28, issue.3, pp.265-297, 1999.
DOI : 10.1002/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8

D. Dereniowski, A. Kosowski, D. Pajak, and P. Uznanski, Bounds on the cover time of parallel rotor walks, 31st International Symposium on Theoretical Aspects of Computer Science STACS 2014, 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

A. S. Fraenkel, Economic Traversal of Labyrinths, Mathematics Magazine, vol.43, issue.3, pp.125-130, 1970.
DOI : 10.2307/2688386

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

L. Gasieniec, T. Radzik, H. Broersma, T. Erlebach, and T. Friedetzky, Memory Efficient Anonymous Graph Exploration, Lecture Notes in Computer Science, vol.5, issue.1, pp.14-29, 2008.
DOI : 10.1137/0405007

A. E. Holroyd, L. Levine, K. Mészáros, Y. Peres, J. Propp et al., Chip-Firing and Rotor-Routing on Directed Graphs, Progress in Probability, pp.331-364, 2008.
DOI : 10.1007/978-3-7643-8786-0_17
URL : http://arxiv.org/abs/0801.3306

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

A. Kosowski and D. Pajak, Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router, Automata, Languages, and Programming -41st International Colloquium, ICALP 2014 Proceedings, Part II, pp.544-555, 2014.
DOI : 10.1007/978-3-662-43951-7_46
URL : https://hal.archives-ouvertes.fr/hal-00950743

V. B. 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

A. N. Strahler, HYPSOMETRIC (AREA-ALTITUDE) ANALYSIS OF EROSIONAL TOPOGRAPHY, Geological Society of America Bulletin, vol.63, issue.11, pp.1117-1142, 1952.
DOI : 10.1130/0016-7606(1952)63[1117:HAAOET]2.0.CO;2

W. T. Tutte and C. A. Smith, On Unicursal Paths in a Network of Degree 4, The American Mathematical Monthly, vol.48, issue.4, pp.233-237, 1941.
DOI : 10.2307/2302716

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