Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots

From MaRDI portal

Revision as of 19:12, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2037834

Jump to:navigation, search

DOI10.1007/978-3-030-62401-9_11zbMath1475.68395arXiv2004.11439OpenAlexW3095642911MaRDI QIDQ2037834

Anisur Rahaman Molla, William K. jun. Moses, Kaushik Mondal

Publication date: 8 July 2021

Full work available at URL: https://arxiv.org/abs/2004.11439

zbMATH Keywords

dispersion rings mobile robots distributed algorithm Byzantine faults faulty robots

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Related Items (6)

Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots ⋮ Memory optimal dispersion by anonymous mobile robots ⋮ Collaborative dispersion by silent robots ⋮ Fault-tolerant dispersion of mobile robots ⋮ Memory optimal dispersion by anonymous mobile robots ⋮ Dispersion of mobile robots on directed anonymous graphs

This page was built for publication: Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2037834&oldid=14509741"