A further study on weak Byzantine gathering of mobile agents

DOI10.1016/j.tcs.2024.114892MaRDI QIDQ6646449

Kaushik Mondal, Ashish Saxena

Publication date: 2 December 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

mobile agentsgatheringdeterministic algorithmByzantine faultsanonymous graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• How to meet in anonymous network
• The theory of search games and rendezvous.
• Fast Byzantine gathering with visibility in graphs
• Byzantine gathering in polynomial time
• Byzantine gathering in networks
• Asynchronous deterministic rendezvous in graphs
• Deterministic rendezvous in graphs
• Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences
• How to meet asynchronously (almost) everywhere
• Undirected connectivity in log-space
• Two Dimensional Rendezvous Search
• Finding Your Kids When They Are Lost
• Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
• Rendezvous search when marks are left at the starting points
• Deterministic gathering with crash faults
• Minimax Rendezvous on the Line
• Gathering Despite Mischief
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• The rendezvous problem on discrete locations

This page was built for publication: A further study on weak Byzantine gathering of mobile agents