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
Random walks on weighted graphs, and applications to on-line algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of 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
Asymmetric rendezvous on the plane
Proceedings of the fourteenth annual symposium on Computational geometry
SIAM Journal on Control and Optimization
Meeting times of random walks on graphs
Information Processing Letters
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
Gathering of Asynchronous Oblivious Robots with Limited Visibility
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
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
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
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
Polynomial deterministic rendezvous in arbitrary graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic Rendezvous in Trees with Little Memory
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Quiescence of self-stabilizing gossiping among mobile agents in graphs
Theoretical Computer Science
Faster treasure hunt and better strongly universal exploration sequences
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Randomized rendez-vous with limited memory
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Delays induce an exponential memory gap for rendezvous in trees
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
How to meet when you forget: log-space rendezvous in arbitrary graphs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Randomized rendezvous with limited memory
ACM Transactions on Algorithms (TALG)
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Mobile agent rendezvous: a survey
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Decidability classes for mobile agents computing
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Time vs. space trade-offs for rendezvous in trees
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Delays Induce an Exponential Memory Gap for Rendezvous in Trees
ACM Transactions on Algorithms (TALG)
How to meet asynchronously at polynomial cost
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Deterministic polynomial approach in the plane
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Price of asynchrony in mobile agents computing
Theoretical Computer Science
| Hi-index | 0.00 |
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 ${\cal O}(n\log \ell)$, 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 in [18] For general networks we show a protocol with cost polynomial in n and logℓ, independent of the maximum difference τ of startup times, which answers in affirmative the open question from [22]