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 QIDQ820545FDOQ820545
Authors: 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
Recommendations
- Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
- Collaborative dispersion by silent robots
- Efficient Dispersion of Mobile Agents without Global Knowledge
- Optimal deterministic ring exploration with oblivious asynchronous robots
- Uniform dispersal of asynchronous finite-state mobile robots in presence of holes
Cites Work
- Computation in networks of passively mobile finite-state sensors
- Distributed computing by mobile robots: gathering
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Gathering despite mischief
- Label-guided graph exploration by a finite automaton
- Graph exploration by a finite automaton
- Euler Tour Lock-In Problem in the Rotor-Router Model
- Impossibility of gathering by a set of autonomous mobile robots
- Uniform multi-agent deployment on a ring
- Structural Information and Communication Complexity
- Deterministic network exploration by a single agent with Byzantine tokens
- Fast collaborative graph exploration
- 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
- Byzantine gathering in networks
- Time and space optimality of rotor-router graph exploration
- Rendezvous in networks in spite of delay faults
- Exploration of Faulty Hamiltonian Graphs
- Mobile agents in distributed computing: network exploration
- Search on a line by Byzantine robots
- Byzantine gathering in polynomial time
- Uniform Deployment of Mobile Agents in Asynchronous Rings
Cited In (4)
This page was built for publication: Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820545)
