Gathering despite mischief

MaRDI QIDQ5743418zbMATH OpenFDO

Authors Yoann Dieudonné, Andrzej Pelc, David Peleg

Publication date 10 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=2095161

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Gathering despite mischief
• Byzantine gathering in polynomial time
• Byzantine gathering in polynomial time

Cites work

• scientific article; zbMATH DE number 1688369 (Why is no real title available?)
• scientific article; zbMATH DE number 2038783 (Why is no real title available?)
• scientific article; zbMATH DE number 2102782 (Why is no real title available?)
• scientific article; zbMATH DE number 2216492 (Why is no real title available?)
• Asynchronous deterministic rendezvous in graphs
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Decidability classes for mobile agents computing
• Delays induce an exponential memory gap for rendezvous in trees
• Deterministic Rendezvous in Trees with Little Memory
• Deterministic rendezvous in graphs
• Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• Finding Your Kids When They Are Lost
• How to Meet in Anonymous Network
• How to meet asynchronously (almost) everywhere
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• LATIN 2004: Theoretical Informatics
• Minimax Rendezvous on the Line
• Operations research/management science at work.
• Probability and Computing
• Randomized Rendez-Vous with Limited Memory
• Reaching Agreement in the Presence of Faults
• Rendezvous Search on the Line
• Rendezvous of mobile agents without agreement on local orientation
• Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
• Rendezvous search on a graph
• Rendezvous search on labeled networks
• Rendezvous search when marks are left at the starting points
• The Byzantine generals strike again
• The Rendezvous Search Problem
• The rendezvous problem on discrete locations
• Two Dimensional Rendezvous Search
• Undirected connectivity in log-space

Cited in

(11)

• Deterministic polynomial approach in the plane
• Rendezvous problem
• Byzantine gathering in polynomial time
• Price of asynchrony in mobile agents computing
• Byzantine gathering in networks with authenticated whiteboards
• Gathering despite mischief
• Byzantine gathering in polynomial time
• Fast Byzantine gathering with visibility in graphs
• Move-optimal partial gathering of mobile agents in asynchronous trees
• Want to gather? No need to chatter!
• A unified approach for gathering and exclusive searching on rings under weak assumptions

This page was built for publication: Gathering despite mischief

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743418)