Search on a Line by Byzantine Robots
From MaRDI portal
Publication:4636509
DOI10.4230/LIPIcs.ISAAC.2016.27zbMath1398.68651arXiv1611.08209OpenAlexW2557516132MaRDI QIDQ4636509
Jurek Czyzowicz, Jaroslav Opatrny, Konstantinos Georgiou, Sunil M. Shende, Danny Krizanc, Lata Narayanan, Evangelos Kranakis
Publication date: 19 April 2018
Full work available at URL: https://arxiv.org/abs/1611.08209
Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots, Querying with Uncertainty, Byzantine gathering in polynomial time, Best-of-both-worlds analysis of online search, Optimal circle search despite the presence of faulty robots, Unnamed Item, Better Upper Bounds for Searching on a Line with Byzantine Robots, Lower bounds for searching robots, some faulty, Linear search by a pair of distinct-speed robots, Unnamed Item, Gathering in the plane of location-aware robots in the presence of spies, Wireless evacuation on \(m\) rays with \(k\) searchers, Byzantine fault tolerant symmetric-persistent circle evacuation, Time-energy tradeoffs for evacuation by two robots in the wireless model, Byzantine fault tolerant symmetric-persistent circle evacuation, Energy Consumption of Group Search on a Line
