Byzantine fault tolerant symmetric-persistent circle evacuation

DOI10.1016/j.tcs.2023.113839OpenAlexW4360841392MaRDI QIDQ5925703

Ioannis Papaioannou, Aris Pagourtzis, Nikos Leonardos

Publication date: 26 April 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113839

zbMATH Keywords

evacuationByzantine faultscrash faultswireless communication face-to-face communication

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Theory of optimal search
• The theory of search games and rendezvous.
• Evacuation from a disc in the presence of a faulty robot
• Search on a line with faulty robots
• Search on a Line by Byzantine Robots
• Evacuating Robots via Unknown Exit in a Disk

This page was built for publication: Byzantine fault tolerant symmetric-persistent circle evacuation