Lower Bounds for Searching Robots, some Faulty

DOI10.1145/3212734.3212745zbMath1428.68165arXiv1707.05077OpenAlexW2962698814MaRDI QIDQ5197710

Ermo Welzl, Andrey B. Kupavskii

Publication date: 19 September 2019

Published in: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

lower boundshybrid algorithms\(m\)-ray searchcow-at-a-fence problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (5)

Best-of-both-worlds analysis of online search ⋮ Search on a Line by Byzantine Robots ⋮ Weighted online search ⋮ Online search with a hint ⋮ Better Upper Bounds for Searching on a Line with Byzantine Robots

This page was built for publication: Lower Bounds for Searching Robots, some Faulty