Problems complete for deterministic logarithmic space
Journal of Algorithms
Token management schemes and random walks yield self-stabilizing mutual exclusion
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Collisions among random walks on a graph
SIAM Journal on Discrete Mathematics
Randomized algorithms
SIAM Journal on Control and Optimization
Minimax Rendezvous on the Line
SIAM Journal on Control and Optimization
Self-stabilizing algorithms for synchronous unidirectional rings
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Agent Rendezvous: A Dynamic Symmetry-Breaking Problem
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Randomized Pursuit-Evasion in Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Operations Research
Two Dimensional Rendezvous Search
Operations Research
Mobile Agent Rendezvous in a Ring
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Deterministic Rendezvous in Graphs
Algorithmica
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Asynchronous deterministic rendezvous in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Classifying rendezvous tasks of arbitrary dimension
Theoretical Computer Science
Distributed algorithms for edge dominating sets
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
How to meet asynchronously (almost) everywhere
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Tell me where i am so i can meet you sooner: asynchronous rendezvous with location information
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Rendezvous of mobile agents in directed graphs
DISC'10 Proceedings of the 24th international conference on Distributed computing
Almost optimal asynchronous rendezvous in infinite multidimensional grids
DISC'10 Proceedings of the 24th international conference on Distributed computing
Asynchronous deterministic rendezvous in bounded terrains
Theoretical Computer Science
DISC 2011 invited lecture: deterministic rendezvous in networks: survey of models and results
DISC'11 Proceedings of the 25th international conference on Distributed computing
Synchronous rendezvous for location-aware agents
DISC'11 Proceedings of the 25th international conference on Distributed computing
Optimal Symmetric Rendezvous Search on Three Locations
Mathematics of Operations Research
Asynchronous deterministic rendezvous in bounded terrains
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Asynchronous rendezvous of anonymous agents in arbitrary graphs
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
How to meet asynchronously (almost) everywhere
ACM Transactions on Algorithms (TALG)
Hi-index | 5.23 |
A set of k mobile agents with distinct identifiers and located in nodes of an unknown anonymous connected network, have to meet at some node. We show that this gathering problem is no harder than its special case for k=2, called the rendezvous problem, and design deterministic protocols solving the rendezvous problem with arbitrary startups in rings and in general networks. The measure of performance is the number of steps since the startup of the last agent until the rendezvous is achieved. For rings we design an oblivious protocol with cost O(nlog@?), where n is the size of the network and @? is the minimum label of participating agents. This result is asymptotically optimal due to the lower bound showed by [A. Dessmark, P. Fraigniaud, D. Kowalski, A. Pelc, Deterministic rendezvous in graphs, Algorithmica 46 (2006) 69-96]. For general networks we show a protocol with cost polynomial in n and log@?, independent of the maximum difference @t of startup times, which answers in the affirmative the open question by [A. Dessmark, P. Fraigniaud, D. Kowalski, A. Pelc, Deterministic rendezvous in graphs, Algorithmica 46 (2006) 69-96].