How to meet in anonymous network

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4056 LNCS, Issue , 2006, Pages 44-58

  Kowalski, Dariusz R ^a   Malinowski, Adam ^b  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

Anonymous networks; Distributed algorithms; Gathering; Mobile agents; Rendezvous

Indexed keywords

COMPUTER NETWORKS; COMPUTER SCIENCE; NETWORK PROTOCOLS; POLYNOMIALS; PROBLEM SOLVING;

ANONYMOUS NETWORKS; DISTRIBUTED ALGORITHMS; GATHERING; MOBILE AGENTS; RENDEZVOUS;

INTELLIGENT AGENTS;

EID: 33746382915     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780823_5     Document Type: Conference Paper

References (29)

1. M. Adler, H. Racke, C. Sohler, N. Sivadasan, and B. Voecking, Randomized pursuit-evasion in graphs, Proc. 29th Int. Colloquium on Automata, Languages and Programming (ICALP'2002), 901-912.
2. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász, and C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, Proc. 20th Annual Symposium on Foundations of Computer Science (FOCS'1979), 218-223.
3. S. Alpern, The rendezvous search problem, SIAM J. on Control and Optimization 33 (1995), 673-683.
4. S. Alpern, Rendezvous search on labelled networks, Naval Research Logistics 49 (2002), 256-274.
5. S. Alpern, and S. Gal, The theory of search games and rendezvous. Int. Series in Operations research and Management Science, Kluwer Academic Publisher, 2002.
6. J. Alpern, V. Baston, and S. Essegaier, Rendezvous search on a graph, Journal of Applied Probability 36 (1999), 223-231.
7. E. Anderson, and R. Weber, The rendezvous problem on discrete locations, Journal of Applied Probability 28 (1990), 839-851.
8. E. Anderson, and S. Fekete, Asymmetric rendezvous on the plane, Proc. 14th Annual ACM Symp. on Computational Geometry, 1998.
9. E. Anderson, and S. Fekete, Two-dimensional rendezvous search, Oper. Research 49 (2001), 107-118.
10. V. Baston, and S. Gal, Rendezvous on the line when the players' initial distance is given by an unknown probability distribution, SIAM J. on Control and Optimization 36 (1998), 1880-1889.
11. V. Baston, and S. Gal, Rendezvous search when marks are left at the starting points, Naval Reaserch Logistics 48 (2001), 722-731.
12. N. H. Bshouty, L. Higham, and J. Warpechowska-Gruca, Meeting times of random walks on graphs, Information Processing Letters 69(5) (1999), 259-265.
13. M. Cielibak, P. Flocchini, G. Prencipe, and N. Santoro, Solving the robots gathering problem, Proc. 30th International Colloquium on Automata, Languages and Programming (ICALP'2003), LNCS 2719, 1181-1196.
14. S.A. Cook and P. McKenzie, Problems complete for deterministic logarithmic space, Journal of Algorithms 8 (5) (1987), 385-394.
15. D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir, Random walks on weighted graphs, and applications to on-line algorithms, Proc. 22nd Annual ACM Symp. on Theory of Computing (STOC'1990), 369-378.
16. D. Coppersmith, P. Tetali, and P. Winkler, Collisions among random walks on a graph, SIAM J. on Discrete Math. 6 (1993), 363-374.
17. G. De Marco, L. Gargano, E. Kranakis, D. Krizanc, A. Pelc, and U. Vaccaro, Asynchronous deterministic rendezvous in graphs, Proc. 30th Int. Symp. on Math. Found. of Comp. Science (MFCS'2005), LNCS 3618, 271-282.
18. A. Dessmark, P. Fraigniaud, and A. Pelc, Deterministic rendezvous in graphs, Proc. 11th European Symposium on Algorithms (ESA'2003), LNCS 2832, 184-195.
19. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, Gathering of asynchronous oblivious robots with limited visibility, Proc. 18th Ann. Symp. on Theoretical Aspects of Comp. Science (STACS'2001), LNCS 2010, 247-258.
20. S. Gal, Rendezvous search on the line, Operations Research 47 (1999), 974-976.
21. A. Israeli, and M. Jalfon, Token management schemes and random walks yield self stabilizing mutual exclusion, Proc. 9th ACM Symp. on Principles of Distributed Computing (PODC'1990), 119-131.
22. D. Kowalski, and A. Pelc, Polynomial deterministic rendezvous in arbitrary graphs, Proc. 15th Annual Symp. on Algorithms and Computation (ISAAC'2004), LNCS 3341, 644-656.
23. E. Kranakis, D. Krizanc, N. Santoro, and C. Sawchuk, Mobile agent rendezvous in a ring, Proc. 23rd Int. Conference on Distributed Computing Systems (ICDCS'2003), 592-599.
24. W. Lim, and S. Alpern, Minimax rendezvous on the line, SIAM J. on Control and Optimization 34 (1996), 1650-1665.
25. A.J. Mayer, R. Ostrovsky, and M. Yung, Self-stabilizing algorithms for synchronous unidirectional rings, Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'1996), 564-573.
26. Motwani, Raghawan, Randomized Algorithms, Cambridge University Press, 1995.
27. T. Schelling, The strategy of conflict, Oxford University Press, Oxford, 1960.
28. L. Thomas, Finding your kids when they are lost, Journal on Operational Res. Soc. 43 (1992), 637-639.
29. X. Yu, and M. Yung, Agent rendezvous: a dynamic symmetry-breaking problem, Proc. International Colloquium on Automata, Languages, and Programming (ICALP'1996), LNCS 1099, 610-621.