How to meet in anonymous network

Theoretical Computer Science

Volumn 399, Issue 1-2, 2008, Pages 141-156

  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

ASYMPTOTIC ANALYSIS; MOBILE AGENTS; PARALLEL ALGORITHMS; PROBLEM SOLVING;

ANONYMOUS NETWORKS; GATHERING; RENDEZVOUS;

NETWORK PROTOCOLS;

EID: 42749093516     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.02.010     Document Type: Article

References (24)

1. M. Adler, H. Racke, C. Sohler, N. Sivadasan, B. Voecking, Randomized pursuit-evasion in graphs, in: Proc. 29th Int. Colloquium on Automata, Languages and Programming, ICALP'2002, pp. 901-912
2. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász, C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, in: Proc. 20th Symposium on Foundations of Computer Science, FOCS'1979, pp. 218-223
3. Alpern S. The rendezvous search problem. SIAM Journal on Control and Optimization 33 (1995) 673-683
4. Alpern S. Rendezvous search on labelled networks. Naval Research Logistics 49 (2002) 256-274
5. Alpern S., and Gal S. The Theory of Search Games and Rendezvous. Int. Series in Operations Research and Management Science (2002), Kluwer Academic Publisher
6. Alpern J., Baston V., and Essegaier S. Rendezvous search on a graph. Journal of Applied Probability 36 (1999) 223-231
7. Anderson E., and Weber R. The rendezvous problem on discrete locations. Journal of Applied Probability 28 (1990) 839-851
8. Anderson E., and Fekete S. Two-dimensional rendezvous search. Operation Research 49 (2001) 107-118
9. Baston V., and Gal S. Rendezvous search when marks are left at the starting points. Naval Research Logistics 48 (2001) 722-731
10. M. Cielibak, P. Flocchini, G. Prencipe, N. Santoro, Solving the robots gathering problem, in: Proc. 30th International Colloquium on Automata, Languages and Programming, ICALP'2003, LNCS 2719, pp. 1181-1196
11. Cook S.A., and McKenzie P. Problems complete for deterministic logarithmic space. Journal of Algorithms 8 5 (1987) 385-394
12. Coppersmith D., Tetali P., and Winkler P. Collisions among random walks on a graph. SIAM Journal on Discrete Mathematics 6 (1993) 363-374
13. G. De Marco, L. Gargano, E. Kranakis, D. Krizanc, A. Pelc, U. Vaccaro, Asynchronous deterministic rendezvous in graphs, in: Proc. 30th Int. Symp. on Math. Found. of Comp. Science, MFCS'2005, LNCS 3618, pp. 271-282
14. Dessmark A., Fraigniaud P., Kowalski D., and Pelc A. Deterministic rendezvous in graphs. Algorithmica 46 (2006) 69-96
15. P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer, Gathering of asynchronous oblivious robots with limited visibility, in: Proc. 18th Ann. Symp. on Theoretical Aspects of Comp. Science, STACS'2001, LNCS 2010, pp. 247-258
16. Gal S. Rendezvous search on the line. Operations Research 47 (1999) 974-976
17. A. Israeli, M. Jalfon, Token management schemes and random walks yield self stabilizing mutual exclusion, in: Proc. 9th ACM Symp. on Principles of Distributed Computing, PODC'1990, pp. 119-131
18. E. Kranakis, D. Krizanc, N. Santoro, C. Sawchuk, Mobile agent rendezvous in a ring, in: Proc. 23rd Int. Conference on Distributed Computing Systems, ICDCS'2003, pp. 592-599
19. Lim W., and Alpern S. Minimax rendezvous on the line. SIAM Journal on Control and Optimization 34 (1996) 1650-1665
20. A.J. Mayer, R. Ostrovsky, M. Yung, Self-stabilizing algorithms for synchronous unidirectional rings, in: Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'1996, pp. 564-573
21. Motwani R., and Raghawan P. Randomized Algorithms (1995), Cambridge University Press
22. Schelling T. The Strategy of Conflict (1960), Oxford University Press, Oxford
23. A. Ta-Shma, U. Zwick, Deterministic rendezvous, treasure hunts and strongly universal exploration sequences, in: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'2007
24. X. Yu, M. Yung, Agent rendezvous: A dynamic symmetry-breaking problem, in: Proc. International Colloquium on Automata, Languages, and Programming, ICALP'1996, LNCS 1099, pp. 610-621