Mobile agent rendezvous: a survey

Authors:
Evangelos Kranakis;Danny Krizanc;Sergio Rajsbaum
Affiliations:
School of Computer Science, Carleton University, Ottawa, ON, Canada;Department of Mathematics and Computer Science, Wesleyan University, Middletown, Connecticut;Instituto de Matemáticas, Universidad Nacional Autónoma de México (UNAM), Mexico D.F
Venue:
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Year:
2006

Citing 18
Cited 11

The complexity of searching a graph

Journal of the ACM (JACM)
Randomized algorithms

Randomized algorithms
The Rendezvous Search Problem

SIAM Journal on Control and Optimization
Navigating in Unfamiliar Geometric Terrain

SIAM Journal on Computing
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns

SIAM Journal on Computing
Mutual search

Journal of the ACM (JACM)
Exploring unknown undirected graphs

Journal of Algorithms
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
Tree exploration with little memory

Journal of Algorithms
Mobile agent rendezvous in the ring

Mobile agent rendezvous in the ring
Exploring an unknown graph

Journal of Graph Theory
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

Move-optimal gossiping among mobile agents

Theoretical Computer Science
Classifying rendezvous tasks of arbitrary dimension

Theoretical Computer Science
Optimal moves for gossiping among mobile agents

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Fault-tolerant simulation of message-passing algorithms by mobile agents

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Randomized rendez-vous with limited memory

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
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
Distributed security algorithms by mobile agents

ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
A probabilistic model for distributed merging of mobile agents

VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Deterministic rendezvous in networks: A comprehensive survey

Networks
A decentralized solution for locating mobile agents

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent results on the problem of mobile agent rendezvous on distributed networks are surveyed with an emphasis on outlining the various approaches taken by researchers in the theoretical computer science community