Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots
From MaRDI portal
Publication:820545
DOI10.1016/j.tcs.2021.07.008OpenAlexW3183798905MaRDI QIDQ820545
Anisur Rahaman Molla, Kaushik Mondal, William K. jun. Moses
Publication date: 27 September 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.07.008
Cites Work
- Unnamed Item
- Unnamed Item
- Deterministic network exploration by a single agent with Byzantine tokens
- Uniform multi-agent deployment on a ring
- Dispersion of mobile robots on grids
- Gathering of robots in a ring with mobile faults
- Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
- Dispersion of mobile robots: the power of randomness
- Fast collaborative graph exploration
- Byzantine gathering in networks
- Computation in networks of passively mobile finite-state sensors
- Impossibility of gathering by a set of autonomous mobile robots
- Time and space optimality of rotor-router graph exploration
- Graph exploration by a finite automaton
- Rendezvous in networks in spite of delay faults
- Exploration of Faulty Hamiltonian Graphs
- Distributed Computing by Mobile Robots: Gathering
- Euler Tour Lock-In Problem in the Rotor-Router Model
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Search on a Line by Byzantine Robots
- Gathering Despite Mischief
- Label-guided graph exploration by a finite automaton
- Structural Information and Communication Complexity
- Uniform Deployment of Mobile Agents in Asynchronous Rings
This page was built for publication: Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots
