Agent rendezvous: Α dynamic symmetry-breaking problem

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

Volumn 1099, Issue , 1996, Pages 610-621

  Yu, Xiangdong ^a   Yung, Moti ^b  

^a Columbia University ^*  (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DISTRIBUTED COMPUTER SYSTEMS; INTELLIGENT AGENTS; INTELLIGENT COMPUTING; INTELLIGENT ROBOTS;

BASIC PROCEDURE; COMMON KNOWLEDGE; COMPUTING POWER; DETERMINISTIC ALGORITHMS; POTENTIAL SYMMETRY; RANDOMIZED METHOD; RANDOMIZED PROTOCOLS; SYMMETRY-BREAKING;

AUTONOMOUS AGENTS;

EID: 84947780688     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_163     Document Type: Conference Paper

References (6)

1. R. Alelhmas, R.M. Karp, R.J. Lipton, L. Lovasz, and C. Rackoff, "Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems", 20th FOCS, 1979, pp. 218-223.
2. I. Anderson, "Combinatorial Design", John Willey, 1990.
3. A. Israeli, and M. Jalfon, "Token Management Scheme and Random Walks Yield Self-Stabilizing Mutual Exclusion", PODC 90, 119-131.
4. C.H. Papadimitriou, P. Raghavan, M. Sudan and H. Tamaki "Motion Planning on a Graph" FOCS 94.
5. C.H. Papadimitriou and M. Yanakakis, "Shortest Path without a Map" TCS 84, 1991, 127-150.
6. P. Tetali and P. Winkler, "On a Random Walk Problem Arising in Self-Stabilizing Token Management", PODC 91, 273-280.