Gathering despite mischief
From MaRDI portal
Publication:5743418
zbMATH Open1421.68119MaRDI QIDQ5743418FDOQ5743418
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
Recommendations
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
- How to meet asynchronously (almost) everywhere
- Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- 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 (12)
- 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
- Byzantine gathering in networks
- 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)
