Mobile Agent Rendezvous in a Ring Using Faulty Tokens

DOI10.1007/978-3-540-77444-0_29zbMath1131.68313OpenAlexW2155903905MaRDI QIDQ5445769

Shantanu Das

Publication date: 6 March 2008

Published in: Distributed Computing and Networking (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77444-0_29

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (2)

Rendezvous in networks in spite of delay faults ⋮ Deterministic network exploration by a single agent with Byzantine tokens

Cites Work

• Unnamed Item
• The theory of search games and rendezvous.
• Asynchronous deterministic rendezvous in graphs
• Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
• Mobile Agent Rendezvous in a Synchronous Torus
• Structural Information and Communication Complexity
• Principles of Distributed Systems
• A generalized inspection game
• Algorithms - ESA 2003
• SOFSEM 2006: Theory and Practice of Computer Science
• LATIN 2004: Theoretical Informatics

This page was built for publication: Mobile Agent Rendezvous in a Ring Using Faulty Tokens