Problems complete for deterministic logarithmic space
Journal of Algorithms
A random polynomial time algorithm for approximating the volume of convex bodies
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
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
Rendezvous Search on the Line With Distinguishable Players
SIAM Journal on Control and Optimization
SIAM Journal on Control and Optimization
Rendezvous Search on the Line with Indistinguishable Players
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
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
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
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Rendezvous of Mobile Agents When Tokens Fail Anytime
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Asynchronous Deterministic Rendezvous on the Line
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of 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
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
Theoretical Computer Science
Uniform multi-agent deployment on a ring
Theoretical Computer Science
Randomized rendezvous with limited memory
ACM Transactions on Algorithms (TALG)
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Mobile agent rendezvous: a survey
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
How to meet in anonymous network
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Asynchronous deterministic rendezvous in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Gathering asynchronous oblivious mobile robots in a ring
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Mobile robots gathering algorithm with local weak multiplicity in rings
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Optimal deterministic ring exploration with oblivious asynchronous robots
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
Theoretical Computer Science
Hi-index | 0.00 |
The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach Two mobile agents have to meet at some node of a connected graph We study deterministic algorithms for this problem, assuming that agents have distinct identifiers and are located in nodes of an unknown anonymous connected graph Startup times of the agents are arbitrarily decided by the adversary The measure of performance of a rendezvous algorithm is its cost: for a given initial location of agents in a graph, this is the number of steps since the startup of the later agent until rendezvous is achieved Deterministic rendezvous has been previously shown feasible in arbitrary graphs [16] but the proposed algorithm had cost exponential in the number n of nodes and in the smaller identifier l, and polynomial in the difference τ between startup times The following problem was stated in [16]: Does there exist a deterministic rendezvous algorithm with cost polynomial in n, τ and in labels L1, L2 of the agents (or even polynomial in n, τ and log L1, log L2)? We give a positive answer to both problems: our main result is a deterministic rendezvous algorithm with cost polynomial in n, τ and log l We also show a lower bound Ω (n2) on the cost of rendezvous in some family of graphs.