Randomized rendezvous with limited memory

Authors:
Evangelos Kranakis;Danny Krizanc;Pat Morin
Affiliations:
Carleton University, Ottawa, ON, Canada;Wesleyan University, Middletown, CT;Carleton University, Ottawa, ON, Canada
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2011

Citing 19
Cited 0

Collisions among random walks on a graph

SIAM Journal on Discrete Mathematics
The Rendezvous Search Problem

SIAM Journal on Control and Optimization
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns

SIAM Journal on Computing
Probability Models for Computer Science

Probability Models for Computer Science
Collaborative Robot Exploration and Rendezvous: Algorithms, Performance Bounds and Observations

Autonomous Robots
Agent Rendezvous: A Dynamic Symmetry-Breaking Problem

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Mobile Agent Rendezvous in a Ring

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Mobile agent rendezvous in the ring

Mobile agent rendezvous in the ring
Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Asynchronous deterministic rendezvous in graphs

Theoretical Computer Science
Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)

Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)
Rendezvous of Mobile Agents When Tokens Fail Anytime

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
An algorithmic theory of mobile agents

TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Randomized rendez-vous with limited memory

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
How to meet in anonymous network

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Optimal memory rendezvous of anonymous mobile agents in a unidirectional ring

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
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
Mobile agent rendezvous in a synchronous torus

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a trade-off between the expected time for two identical agents to rendezvous on a synchronous, anonymous, oriented ring and the memory requirements of the agents. In particular, we show there exists a 2t state agent which can achieve rendezvous on an n-node ring in expected time O(n2/2t + 2t) and that any t/2 state agent requires expected time Ω(n2/2t). As a corollary we observe that Θ(log log n) bits of memory are necessary and sufficient to achieve rendezvous in linear time.