Gathering despite mischief

zbMATH Open1421.68119MaRDI QIDQ5743418FDOQ5743418

David Peleg, Yoann Dieudonné, Andrzej Pelc

Publication date: 10 May 2019

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

Recommendations

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

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)

Cites Work

• Asynchronous deterministic rendezvous in graphs
• Deterministic rendezvous in graphs
• Delays Induce an Exponential Memory Gap for Rendezvous in Trees
• Deterministic Rendezvous in Trees with Little Memory
• Undirected connectivity in log-space
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Two Dimensional Rendezvous Search
• Rendezvous search when marks are left at the starting points
• Title not available (Why is that?)
• Rendezvous search on labeled networks
• Rendezvous Search on the Line
• Minimax Rendezvous on the Line
• Title not available (Why is that?)
• The Rendezvous Search Problem
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• Title not available (Why is that?)
• The rendezvous problem on discrete locations
• LATIN 2004: Theoretical Informatics
• Probability and Computing
• Reaching Agreement in the Presence of Faults
• The Byzantine generals strike again
• Randomized Rendez-Vous with Limited Memory
• Title not available (Why is that?)
• Title not available (Why is that?)
• How to meet when you forget
• Rendezvous search on a graph
• Title not available (Why is that?)
• Rendezvous of Mobile Agents without Agreement on Local Orientation
• How to Meet in Anonymous Network
• Finding Your Kids When They Are Lost
• Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
• Operations research/management science at work.
• Decidability Classes for Mobile Agents Computing

Cited In (5)

• Deterministic polynomial approach in the plane
• Price of asynchrony in mobile agents computing
• Rendezvous Problem
• Move-optimal partial gathering of mobile agents in asynchronous trees
• 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)