Deterministic rendezvous in trees with little memory

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

Volumn 5218 LNCS, Issue , 2008, Pages 242-256

  Fraigniaud, Pierre ^a   Pelc, Andrzej ^b  

^a CNRS   (France)

^b UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT STATE MACHINES; BOUNDED DEGREE TREES; CONNECTED GRAPHS; GRAPH EXPLORATIONS; IN TREES; INITIAL POSITIONS; LOWER BOUNDS; MEMORY SIZES; UPPER BOUNDS;

COMPUTATIONAL GEOMETRY; CONTROL THEORY; FINITE AUTOMATA; GRAPH THEORY; MOBILE AGENTS; PROBLEM SOLVING;

TREES (MATHEMATICS);

EID: 56449122840     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87779-0_17     Document Type: Conference Paper

References (30)

1. Aleliunas, R., Karp, R.M., Lipton, R.J., Lovász, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: Proc. 20th Annual Symposium on Foundations of Computer Science (FOCS 1979), pp. 218-223 (1979)
2. Alpern, S.: The rendezvous search problem. SIAM J. on Control and Optimization 33, 673-683 (1995)
3. Alpern, S.: Rendezvous search on labelled networks. Naval Reaserch Logistics 49, 256-274 (2002)
4. Alpern, S., Gal, S.: The theory of search games and rendezvous. Int. Series in Operations research and Management Science. Kluwer Academic Publisher, Dordrecht (2002)
5. Alpern, J., Baston, V., Essegaier, S.: Rendezvous search on a graph. Journal of Applied Probability 36, 223-231 (1999)
6. Alpern, S., Gal, S.: Rendezvous search on the line with distinguishable players. SIAM J. on Control and Optimization 33, 1270-1276 (1995)
7. Anderson, E., Weber, R.: The rendezvous problem on discrete locations. Journal of Applied Probability 28, 839-851 (1990)
8. Anderson, E., Essegaier, S.: Rendezvous search on the line with indistinguishable players. SIAM J. on Control and Optimization 33, 1637-1642 (1995)
9. Anderson, E., Fekete, S.: Asymmetric rendezvous on the plane. In: Proc. 14th Annual ACM Symp. on Computational Geometry (1998)
10. Anderson, E., Fekete, S.: Two-dimensional rendezvous search. Operations Research 49, 107-118 (2001)
11. Baston, V., Gal, S.: Rendezvous on the line when the players' initial distance is given by an unknown probability distribution. SIAM J. on Control and Optimization 36, 1880-1889 (1998)
12. Baston, V., Gal, S.: Rendezvous search when marks are left at the starting points. Naval Reaserch Logistics 48, 722-731 (2001)
13. Cook, S.A., McKenzie, P.: Problems complete for deterministic logarithmic space. Journal of Algorithms 8(5), 385-394 (1987)
14. Coppersmith, D., Doyle, P., Raghavan, P., Snir, M.: Random walks on weighted graphs, and applications to on-line algorithms. In: Proc. 22nd Annual ACM Symposium on Theory of Computing (STOC 1990), pp. 369-378 (1990)
15. Coppersmith, D., Tetali, P., Winkler, P.: Collisions among random walks on a graph. SIAM J. on Discrete Math. 6, 363-374 (1993)
16. De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. Theoretical Computer Science 355, 315-326 (2006)
17. Dessmark, A., Fraigniaud, P., Kowalski, D., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica 46, 69-96 (2006)
18. Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree exploration with little memory. Journal of Algorithms 51, 38-63 (2004)
19. Dyer, M., Frieze, A., Kannan, R.: A random polynomial time algorithm for estimating volumes of convex bodies. In: Proc. 21st Annual ACM Symposium on Theory of Computing (STOC 1989), pp. 375-381 (1989)
20. Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous oblivious robots with limited visibility. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 247-258. Springer, Heidelberg (2001)
21. Gal, S.: Rendezvous search on the line. Operations Research 47, 974-976 (1999)
22. Gasieniec, L., Pelc, A., Radzik, T., Zhang, X.: Tree exploration with logarithmic memory. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 585-594 (2007)
23. Israeli, A., Jalfon, M.: Token management schemes and random walks yield self stabilizing mutual exclusion. In: Proc. 9th Annual ACM Symposium on Principles of Distributed Computing (PODC 1990), pp. 119-131 (1990)
24. Kowalski, D., Malinowski, A.: How to meet in anonymous network. In: Flocchini, P., Gasieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 44-58. Springer, Heidelberg (2006)
25. Kranakis, E., Krizanc, D., Morin, P.: Randomized Rendez-Vous with Limited Memory. In: Proc. 8th Latin American Theoretical INformatics (LATIN) (2008)
26. Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proc. 23rd International Conference on Distributed Computing Systems (ICDCS 2003), pp. 592-599 (2003)
27. Lim, W., Alpern, S.: Minimax rendezvous on the line. SIAM J. on Control and Optimization 34, 1650-1665 (1996)
28. Schelling, T.: The strategy of conflict. Oxford University Press, Oxford (1960)
29. Thomas, L.: Finding your kids when they are lost. Journal on Operational Res. Soc. 43, 637-639 (1992)
30. Yu, X., Yung, M.: Agent rendezvous: a dynamic symmetry-breaking problem. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 610-621. Springer, Heidelberg (1996)