Distributed Algorithms For Unidirectional Networks, SIAM Journal on Computing, vol.23, issue.6, pp.1152-1178, 1994. ,
DOI : 10.1137/S009753979223277X
Exploring Unknown Environments, SIAM Journal on Computing, vol.29, issue.4, pp.1164-1188, 2000. ,
DOI : 10.1137/S009753979732428X
Exploring Unknown Environments with Obstacles, Algorithmica, vol.32, issue.1, pp.123-143, 2002. ,
DOI : 10.1007/s00453-001-0067-x
Random walks on finite groups and rapidly mixing markov chains, Seminaire de Probabilites XVII, pp.243-297, 1983. ,
DOI : 10.1214/aop/1176994578
Meeting times for independent Markov chains, Stochastic Processes and their Applications, pp.185-193, 1991. ,
DOI : 10.1016/0304-4149(91)90090-Y
Reversible Markov Chains and Random Walks on Graphs, 2001. ,
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
Recent Advances on Multi-agent Patrolling, SBIA, pp.474-483, 2004. ,
DOI : 10.1007/978-3-540-28645-5_48
URL : https://hal.archives-ouvertes.fr/hal-01499300
Many random walks are faster than one, SPAA, pp.119-128, 2008. ,
DOI : 10.1145/1378533.1378557
URL : http://arxiv.org/abs/0705.0467
The Rendezvous Search Problem, SIAM Journal on Control and Optimization, vol.33, issue.3, pp.673-683, 1995. ,
DOI : 10.1137/S0363012993249195
Rendezvous search on labeled networks, Naval Research Logistics, vol.48, issue.3, pp.256-274, 2002. ,
DOI : 10.1002/nav.10011
The theory of search games and rendezvous. International Series in Operations research and Management Science, 2002. ,
A compendium of problems complete for symmetric logarithmic space, Computational Complexity, vol.9, issue.2, pp.123-145, 2000. ,
DOI : 10.1007/PL00001603
Quantum Walk Algorithm for Element Distinctness, SIAM Journal on Computing, vol.37, issue.1, pp.210-239, 2007. ,
DOI : 10.1137/S0097539705447311
URL : http://arxiv.org/abs/quant-ph/0311001
Tree exploration with logarithmic memory, ACM Transactions on Algorithms, vol.7, issue.2, p.17, 2011. ,
DOI : 10.1145/1921659.1921663
Asymmetric rendezvous on the plane, Proceedings of the fourteenth annual symposium on Computational geometry , SCG '98, pp.365-373, 1998. ,
DOI : 10.1145/276884.276925
Two Dimensional Rendezvous Search, Operations Research, vol.49, issue.1, pp.107-118, 2001. ,
DOI : 10.1287/opre.49.1.107.11191
The rendezvous problem on discrete locations, Journal of Applied Probability, vol.27, issue.04, pp.839-851, 1990. ,
DOI : 10.2307/3214009
Local and global properties in networks of processors, Proceedings of 12th Symposium on Theory of Computing (STOC), pp.82-93, 1980. ,
Computational Complexity: A Modern Approach, 2009. ,
DOI : 10.1017/CBO9780511804090
Computing on an anonymous ring, Journal of the ACM, vol.35, issue.4, pp.845-875, 1988. ,
DOI : 10.1145/48014.48247
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs), Lecture Notes in Computer Science, vol.5125, issue.1, pp.121-132, 2008. ,
DOI : 10.1007/978-3-540-70575-8_11
Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees, Proceedings of the 17th international conference on Structural Information and Communication Complexity , SIROCCO'10, pp.86-100, 2010. ,
DOI : 10.1007/978-3-642-13284-1_8
Supervised random walks, Proceedings of the fourth ACM international conference on Web search and data mining, WSDM '11, pp.635-644, 2011. ,
DOI : 10.1145/1935826.1935914
Short random walks on graphs, STOC, pp.728-737, 1993. ,
Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution, SIAM Journal on Control and Optimization, vol.36, issue.6, pp.1880-1889, 1998. ,
DOI : 10.1137/S0363012996314130
Rendezvous search when marks are left at the starting points, Naval Research Logistics, vol.40, issue.8, pp.722-731, 2001. ,
DOI : 10.1002/nav.1044
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
The power of team exploration: two robots can learn unlabeled directed graphs, Proceedings 35th Annual Symposium on Foundations of Computer Science, pp.75-85, 1994. ,
DOI : 10.1109/SFCS.1994.365703
Speeding up random walks with neighborhood exploration, pp.1422-1435, 2010. ,
DOI : 10.1137/1.9781611973075.115
Traversing Directed Eulerian Mazes, Journal of Graph Algorithms and Applications, vol.6, issue.2, pp.157-173, 2002. ,
DOI : 10.7155/jgaa.00049
Flows, View Obstructions, and the Lonely Runner, Journal of Combinatorial Theory, Series B, vol.72, issue.1, pp.1-9, 1998. ,
DOI : 10.1006/jctb.1997.1770
Computing anonymously with arbitrary knowledge, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing , PODC '99, pp.181-188, 1999. ,
DOI : 10.1145/301308.301355
An Effective Characterization of Computability in Anonymous Networks, Proceedings of 15th International Conference on Distributed Computing (DISC), pp.33-47, 2001. ,
DOI : 10.1007/3-540-45414-4_3
Fibrations of graphs, Discrete Mathematics, vol.243, issue.1-3, pp.21-66, 2002. ,
DOI : 10.1016/S0012-365X(00)00455-6
Anonymous asynchronous systems: the case of failure detectors, Distributed Computing, vol.7, issue.1, pp.141-158, 2013. ,
DOI : 10.1007/s00446-012-0169-5
URL : https://hal.archives-ouvertes.fr/inria-00452799
Influence maximization in social networks: Towards an optimal algorithmic solution, 1212. ,
Lower bounds on the length of universal traversal sequences, Journal of Computer and System Sciences, vol.45, issue.2, pp.180-203, 1992. ,
DOI : 10.1016/0022-0000(92)90046-L
Local algorithms for finding interesting individuals in large networks, pp.188-199, 2010. ,
Maximum hitting time for random walks on graphs. Random Struct, Algorithms, vol.1, issue.3, pp.263-276, 1990. ,
Connectivity, SIAM Journal on Computing, vol.23, issue.2, pp.324-334, 1994. ,
DOI : 10.1137/S0097539790190144
Meeting times of random walks on graphs, Information Processing Letters, vol.69, issue.5, pp.259-265, 1999. ,
DOI : 10.1016/S0020-0190(99)00017-4
Path coupling: A technique for proving rapid mixing in Markov chains, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.223-231, 1997. ,
DOI : 10.1109/SFCS.1997.646111
Automata and Labyrinths, Mathematische Nachrichten, vol.7, issue.4, pp.195-282, 1978. ,
DOI : 10.1002/mana.19780860120
Distributed Algorithms, Local Calculations, and Graph Homomorphisms, 2006. ,
Mobile Agent Algorithms Versus Message Passing Algorithms, OPODIS, pp.187-201, 2006. ,
DOI : 10.1007/11945529_14
URL : https://hal.archives-ouvertes.fr/hal-00308127
The electrical resistance of a graph captures its commute and cover times, Computational Complexity, vol.5, issue.1, pp.312-340, 1997. ,
DOI : 10.1007/BF01270385
Solving the Robots Gathering Problem, ICALP, pp.1181-1196 ,
DOI : 10.1007/3-540-45061-0_90
Space Lower Bounds for Maze Threadability on Restricted Machines, SIAM Journal on Computing, vol.9, issue.3, pp.636-652, 1980. ,
DOI : 10.1137/0209048
Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful, Lecture Notes in Computer Science, vol.37, issue.5, pp.1-14, 2011. ,
DOI : 10.1007/s00453-003-1030-9
Crawling on web graphs, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , STOC '02, pp.419-427, 2002. ,
DOI : 10.1145/509907.509970
Simulating a Random Walk with Constant Error, Combinatorics, Probability and Computing, vol.15, issue.06, pp.815-822, 2006. ,
DOI : 10.1017/S0963548306007565
Delayed path coupling and generating random permutations via distributed stochastic processes, SODA, pp.271-280, 1999. ,
DOI : 10.1002/1098-2418(200010/12)17:3/4<238::aid-rsa4>3.0.co;2-e
Collision-free network exploration, Journal of Computer and System Sciences, vol.86, 2013. ,
DOI : 10.1016/j.jcss.2016.11.008
URL : https://hal.archives-ouvertes.fr/hal-00736276
More efficient periodic traversal in anonymous undirected graphs, Proceedings of 16th Colloquium on Structural Information and Communication Complexity (SIROCCO), pp.167-181, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00371489
The Beachcombers' Problem: Walking and searching with mobile robots, Theoretical Computer Science, vol.608, 2013. ,
DOI : 10.1016/j.tcs.2015.09.011
Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds, Lecture Notes in Computer Science, vol.6942, pp.701-712, 2011. ,
DOI : 10.1007/978-3-642-23719-5_59
URL : https://hal.archives-ouvertes.fr/hal-00646910
Gathering few fat mobile robots in the plane, Theor. Comput. Sci, vol.410, pp.6-7481, 2009. ,
How to meet asynchronously (almost) everywhere, Proceedings of 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.22-30, 2010. ,
DOI : 10.1145/2344422.2344427
URL : https://hal.archives-ouvertes.fr/hal-00418775
Improved length lower bounds for reflecting sequences, Lecture Notes in Computer Science, vol.1090, pp.56-67, 1996. ,
DOI : 10.1007/3-540-61332-3_139
Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model, pp.197-222, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00755407
Mobile agents in distributed computing: Network exploration, Bulletin of the EACTS, vol.109, pp.54-69, 2013. ,
Map construction of unknown graphs by multiple agents, Theoretical Computer Science, vol.385, issue.1-3, pp.1-334, 2007. ,
DOI : 10.1016/j.tcs.2007.05.011
Circuits and trees in oriented linear graphs, Bulletin of the Belgian Mathematical Society Simon Stevin, vol.28, pp.203-217, 1951. ,
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
Fast collaborative graph exploration, ICALP 2013, p.526 ,
DOI : 10.1016/j.ic.2014.12.005
URL : https://hal.archives-ouvertes.fr/hal-01251826
Distinguishing views in symmetric networks: A tight lower bound, Theoretical Computer Science, vol.582, 2013. ,
DOI : 10.1016/j.tcs.2015.03.018
URL : https://hal.archives-ouvertes.fr/hal-00875370
Deterministic Rendezvous in Graphs, Algorithmica, vol.46, issue.1, pp.69-96, 2006. ,
DOI : 10.1007/s00453-006-0074-2
Optimal Grid Exploration by Asynchronous Oblivious Robots, SSS, pp.64-76, 2012. ,
DOI : 10.1007/978-3-642-33536-5_7
URL : https://hal.archives-ouvertes.fr/hal-00934161
Deterministic gathering of anonymous agents in arbitrary networks, 2011. ,
How to meet asynchronously at polynomial cost. CoRR, abs/1301, 2013. ,
Cover times, blanket times, and majorizing measures, Proceedings of the 43rd annual ACM symposium on Theory of computing, pp.61-70, 2011. ,
Searching for a black hole in arbitrary networks, Proceedings of the twenty-first annual symposium on Principles of distributed computing , PODC '02, pp.1-18, 2006. ,
DOI : 10.1145/571825.571853
Finding short right-handon-the-wall walks in graphs, Proceedings of 12th Colloquium on Structural Information and Communication Complexity (SIROCCO), pp.127-139, 2005. ,
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
Robotic exploration as graph construction, IEEE Transactions on Robotics and Automation, vol.7, issue.6, pp.859-865, 1991. ,
DOI : 10.1109/70.105395
Optimal constrained graph exploration, ACM Transactions on Algorithms, vol.2, issue.3, pp.380-402, 2006. ,
DOI : 10.1145/1159892.1159897
Relationship between the period of a finite word and the length of its unbordered segments, Discrete Mathematics, vol.40, issue.1, pp.31-44, 1982. ,
DOI : 10.1016/0012-365X(82)90186-8
How Well Do Random Walks Parallelize?, APPROX-RANDOM, pp.476-489, 2009. ,
DOI : 10.1007/978-3-642-03685-9_36
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.227.8780
Quantum mechanical interaction-free measurements, Foundations of Physics, vol.167, issue.7, pp.987-997, 1993. ,
DOI : 10.1007/BF00736012
URL : http://arxiv.org/abs/hep-th/9305002
Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization, Lecture Notes in Computer Science, vol.7355, pp.291-302, 2012. ,
DOI : 10.1007/978-3-642-31104-8_25
Tight bounds for the cover time of multiple random walks, ICALP (1), pp.415-426, 2009. ,
A Spectrum of Time???Space Trade-offs for Undirecteds-tConnectivity, Journal of Computer and System Sciences, vol.54, issue.2, pp.305-316, 1997. ,
DOI : 10.1006/jcss.1997.1471
Searching for Black Holes in Subways, Theory of Computing Systems, vol.8, issue.1, pp.158-184, 2012. ,
DOI : 10.1007/s00224-011-9341-8
Sorting and election in anonymous asynchronous rings, Journal of Parallel and Distributed Computing, vol.64, issue.2, pp.254-265, 2004. ,
DOI : 10.1016/j.jpdc.2003.11.007
Multiple Mobile Agent Rendezvous in a Ring, Proceedings of 6th Latin American Symposium on Theoretical Informatics (LATIN), pp.599-608, 2004. ,
DOI : 10.1007/978-3-540-24698-5_62
Distributed Computing by Oblivious Mobile Robots, Synthesis Lectures on Distributed Computing Theory, vol.3, issue.2, 2012. ,
DOI : 10.2200/S00440ED1V01Y201208DCT010
Gathering of asynchronous robots with limited visibility, Theoretical Computer Science, vol.337, issue.1-3, pp.147-168, 2005. ,
DOI : 10.1016/j.tcs.2005.01.001
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots, Theoretical Computer Science, vol.407, issue.1-3, pp.1-3412, 2008. ,
DOI : 10.1016/j.tcs.2008.07.026
Collective tree exploration, Networks, vol.36, issue.3, pp.166-177, 2006. ,
DOI : 10.1002/net.20127
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
Deterministic Rendezvous in Trees with Little Memory, Proceedings of 22nd International Conference on Distributed Computing (DISC), pp.242-256, 2008. ,
DOI : 10.1007/978-3-540-87779-0_17
Delays induce an exponential memory gap for rendezvous in trees, Proceedings of 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp.224-232, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00922693
Rendezvous Search on the Line, Operations Research, vol.47, issue.6, pp.974-976, 1999. ,
DOI : 10.1287/opre.47.6.974
Fast periodic graph exploration with constant memory, Journal of Computer and System Sciences, vol.74, issue.5, pp.802-822, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00306994
Memory Efficient Anonymous Graph Exploration, Lecture Notes in Computer Science, vol.5, issue.1, pp.14-29, 2008. ,
DOI : 10.1137/0405007
Walking in Facebook: A Case Study of Unbiased Sampling of OSNs, 2010 Proceedings IEEE INFOCOM, pp.2498-2506, 2010. ,
DOI : 10.1109/INFCOM.2010.5462078
Random walks in peer-to-peer networks: Algorithms and evaluation, Performance Evaluation, vol.63, issue.3, pp.241-263, 2006. ,
DOI : 10.1016/j.peva.2005.01.002
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures, Lecture Notes in Computer Science, vol.5556, issue.2, pp.484-495, 2009. ,
DOI : 10.1007/978-3-642-02930-1_40
Asynchronous Rendezvous of Anonymous Agents in Arbitrary Graphs, OPODIS, pp.421-434, 2011. ,
DOI : 10.1007/978-3-642-25873-2_29
Locating a target with an agent guided by unreliable local advice, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.355-364, 2010. ,
DOI : 10.1145/1835698.1835781
URL : https://hal.archives-ouvertes.fr/hal-00516695
Searching with mobile agents in networks with liars, Discrete Applied Mathematics, vol.137, issue.1, pp.69-85, 2004. ,
DOI : 10.1016/S0166-218X(03)00189-6
URL : https://hal.archives-ouvertes.fr/hal-00307259
Depth of views on symmetric networks: a new bound for guaranteeing equality, 2012. ,
A solution to the lonely runner conjecture for almost all points, 2011. ,
Fair circulation of a token, IEEE Transactions on Parallel and Distributed Systems, vol.13, issue.4, pp.367-372, 2002. ,
DOI : 10.1109/71.995817
The hitting and cover times of random walks on finite graphs using local degree information, Theoretical Computer Science, vol.410, issue.1, pp.94-100, 2009. ,
DOI : 10.1016/j.tcs.2008.10.020
Setting port numbers for fast graph exploration, Theoretical Computer Science, vol.401, issue.1-3, pp.236-242, 2008. ,
DOI : 10.1016/j.tcs.2008.03.035
URL : https://hal.archives-ouvertes.fr/hal-00339843
Token management schemes and random walks yield self-stabilizing mutual exclusion, Proceedings of the ninth annual ACM symposium on Principles of distributed computing , PODC '90, pp.119-131, 1990. ,
DOI : 10.1145/93385.93409
Self-stabilizing local mutual exclusion on networks in which process identifiers are not distinct, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings., pp.202-211, 2002. ,
DOI : 10.1109/RELDIS.2002.1180189
Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection, MFCS, pp.542-553, 2012. ,
DOI : 10.1007/978-3-642-32589-2_48
URL : https://hal.archives-ouvertes.fr/hal-00934132
Fast connected components algorithms for the erew pram, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, SPAA '92, pp.373-381, 1992. ,
Fence Patrolling by Mobile Agents with Distinct Speeds, ISAAC, pp.598-608, 2012. ,
DOI : 10.1007/978-3-642-35261-4_62
Maximizing the spread of influence through a social network, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.137-146, 2003. ,
DOI : 10.1145/956750.956769
Interval graphs and seatching, Discrete Mathematics, vol.55, issue.2, pp.181-184, 1985. ,
DOI : 10.1016/0012-365X(85)90046-9
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring, Theoretical Computer Science, vol.411, issue.34-36, pp.34-363235, 2010. ,
DOI : 10.1016/j.tcs.2010.05.020
URL : https://hal.archives-ouvertes.fr/hal-00519069
The multi-agent rotorrouter on the ring: A deterministic alternative to parallel random walks, PODC 2013, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00735113
Gathering asynchronous oblivious mobile robots in a ring, Theoretical Computer Science, vol.390, issue.1, pp.27-39, 2008. ,
DOI : 10.1016/j.tcs.2007.09.032
URL : https://hal.archives-ouvertes.fr/hal-00307234
Hardness and approximation results for Black Hole Search in arbitrary networks, Theoretical Computer Science, vol.384, issue.2-3, pp.201-221, 2007. ,
DOI : 10.1016/j.tcs.2007.04.024
URL : https://hal.archives-ouvertes.fr/inria-00070349
The flow of on-line information in global networks, Proceedings of the 2010 international conference on Management of data, SIGMOD '10, pp.1-2, 2010. ,
DOI : 10.1145/1807167.1807169
Complexity of edge counting Technical Report Goal-Directed Acting with Incomplete Information. CMU-CS-97-199, 1997. ,
Easy and hard testbeds for real-time search algorithms, Proceedings of 13th National Conference on Artificial Intelligence (AAAI), pp.279-285, 1996. ,
Toward more localized local algorithms, Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '11, pp.49-58, 2011. ,
DOI : 10.1145/1993806.1993814
URL : https://hal.archives-ouvertes.fr/hal-01241086
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth, Lecture Notes in Computer Science, vol.7392, issue.2, pp.610-622, 2012. ,
DOI : 10.1007/978-3-642-31585-5_54
URL : https://hal.archives-ouvertes.fr/hal-00687120
Synchronous black hole search in directed graphs, Theoretical Computer Science, vol.412, issue.41, pp.5752-5759, 2011. ,
DOI : 10.1016/j.tcs.2011.05.054
URL : https://hal.archives-ouvertes.fr/inria-00614476
Fast randomized graph exploration: When a little bit of memory makes all the difference, 2013. ,
Universal traversal sequences with backtracking, Journal of Computer and System Sciences, vol.65, issue.4, pp.717-726, 2002. ,
DOI : 10.1016/S0022-0000(02)00023-5
How to meet in anonymous network, Theoretical Computer Science, vol.399, issue.1-2, pp.141-156, 2008. ,
DOI : 10.1016/j.tcs.2008.02.010
The Mobile Agent Rendezvous Problem in the Ring, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, 2010. ,
DOI : 10.2200/S00278ED1V01Y201004DCT001
Computing with Mobile Agents in Distributed Networks, 2001. ,
DOI : 10.1201/9781420011296.ch8
Mobile agent rendezvous in a ring, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings., pp.592-599, 2003. ,
DOI : 10.1109/ICDCS.2003.1203510
Computing Boolean Functions on Anonymous Networks, Information and Computation, vol.114, issue.2, pp.214-236, 1994. ,
DOI : 10.1006/inco.1994.1086
Walking on a graph with a magnifying glass, Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, SIGMETRICS '11, pp.241-252, 2011. ,
DOI : 10.1145/1993744.1993773
Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots, Lecture Notes in Computer Science, vol.6058, pp.183-196 ,
DOI : 10.1007/978-3-642-13284-1_15
URL : https://hal.archives-ouvertes.fr/hal-01009453
Beyond random walk and metropolis-hastings samplers, ACM SIGMETRICS Performance Evaluation Review, vol.40, issue.1, pp.319-330, 2012. ,
DOI : 10.1145/2318857.2254795
Minimax Rendezvous on the Line, SIAM Journal on Control and Optimization, vol.34, issue.5, pp.1650-1665, 1996. ,
DOI : 10.1137/S036301299427816X
Littlewood's Miscellany, 1986. ,
Random walks on graphs: A survey, Bolyai Society Mathematical Studies, vol.2, pp.353-397, 1996. ,
Quantum Algorithms for the Triangle Problem, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '05, pp.1109-1117, 2005. ,
DOI : 10.1137/050643684
Distributed token circulation in mobile ad hoc networks, IEEE Transactions on Mobile Computing, vol.4, issue.2, pp.154-165, 2005. ,
DOI : 10.1109/TMC.2005.25
Asynchronous deterministic rendezvous in graphs, Theoretical Computer Science, vol.355, issue.3, pp.315-326, 2006. ,
DOI : 10.1016/j.tcs.2005.12.016
Covering Problems for Brownian Motion on Spheres, The Annals of Probability, vol.16, issue.1, pp.189-199, 1988. ,
DOI : 10.1214/aop/1176991894
Equation of State Calculations by Fast Computing Machines, The Journal of Chemical Physics, vol.21, issue.6, pp.1087-1092, 1953. ,
DOI : 10.1063/1.1699114
The simple random walk and max-degree walk on a directed graph. Random Struct, Algorithms, vol.34, issue.3, pp.395-407, 2009. ,
RL???SC, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing , STOC '92, pp.619-623, 1992. ,
DOI : 10.1145/129712.129772
The hitting and cover times of Metropolis walks, Theoretical Computer Science, vol.411, issue.16-18, pp.16-181889, 2010. ,
DOI : 10.1016/j.tcs.2010.01.032
Universal covers of graphs: Isomorphism to depth n ??? 1 implies isomorphism to all depths, Discrete Applied Mathematics, vol.56, issue.1, pp.61-74, 1995. ,
DOI : 10.1016/0166-218X(93)E0133-J
Fast Random Walks on Finite Graphs and Graph Topological Information, 2011 Second International Conference on Networking and Computing, pp.360-363, 2011. ,
DOI : 10.1109/ICNC.2011.70
The pagerank citation ranking: bringing order to the web, 1999. ,
Exploring Unknown Undirected Graphs, Journal of Algorithms, vol.33, issue.2, pp.281-295, 1999. ,
DOI : 10.1006/jagm.1999.1043
Impact of topographic information on graph exploration efficiency, Networks, vol.28, issue.2, pp.96-103, 2000. ,
DOI : 10.1002/1097-0037(200009)36:2<96::AID-NET4>3.0.CO;2-N
DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results, Lecture Notes in Computer Science, vol.7, pp.1-15, 2011. ,
DOI : 10.1109/71.481599
Distributed Computing: A Locality-Sensitive Approach, SIAM, 2000. ,
DOI : 10.1137/1.9780898719772
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
Undirected connectivity in log-space, Journal of the ACM, vol.55, issue.4, pp.1-24, 2008. ,
DOI : 10.1145/1391289.1391291
Pseudorandom walks on regular digraphs and the RL vs. L problem, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , STOC '06, pp.457-466, 2006. ,
DOI : 10.1145/1132516.1132583
External memory algorithms for string problems, Fundam. Inform, vol.84, issue.1, pp.17-32, 2008. ,
Automata in planar graphs, Acta Informatica, vol.4, issue.3, pp.287-298, 1980. ,
DOI : 10.1007/BF00288647
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
The strategy of conflict, 1960. ,
Gathering Asynchronous Mobile Robots with Inaccurate Compasses, OPODIS, pp.333-349, 2006. ,
DOI : 10.1007/11945529_24
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns, SIAM Journal on Computing, vol.28, issue.4, pp.1347-1363, 1999. ,
DOI : 10.1137/S009753979628292X
Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences, Proceedings of 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.599-608, 2007. ,
DOI : 10.1145/2601068
Finding Your Kids When They Are Lost, Journal of the Operational Research Society, vol.43, issue.6, pp.637-639, 1992. ,
DOI : 10.1057/jors.1992.89
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
Smell as a computational resource ? a lesson we can learn from the ant, Proceedings of 4th Israel Symposium on Theory of Computing and Systems (ISTCS), pp.219-230, 1996. ,
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
Elitzur-Vaidman bomb tester ? Wikipedia, The Free Encyclopedia, 2013. [Online; accessed 8, 2013. ,
Multiple cover time. Random Structures and Algorithms, pp.403-411, 1996. ,
Computing functions on asynchronous anonymous networks, Mathematical Systems Theory Erratum: Theory of Computing System, vol.29, issue.311, pp.331-356, 1996. ,
Computing on an anonymous network, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.69-89, 1996. ,
DOI : 10.1145/62546.62568
Leader election problem on networks in which processor identity numbers are not distinct, IEEE Transactions on Parallel and Distributed Systems, vol.10, issue.9, pp.878-887, 1999. ,
DOI : 10.1109/71.798313
Characterizing geometric patterns formable by oblivious anonymous mobile robots, Theoretical Computer Science, vol.411, issue.26-28, pp.26-282433, 2010. ,
DOI : 10.1016/j.tcs.2010.01.037
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
Agent rendezvous: A dynamic symmetry-breaking problem, Proceedings of 23rd International Colloquium on Automata, Languages and Programming (ICALP), pp.610-621, 1996. ,
DOI : 10.1007/3-540-61440-0_163
A local algorithm for finding wellconnected clusters. CoRR, abs/1304, 2013. ,