Lower bounds for searching robots, some faulty

DOI10.1007/s00446-019-00358-yOpenAlexW2965001836MaRDI QIDQ1981629

Andrey B. Kupavskii, Ermo Welzl

Publication date: 6 September 2021

Published in: Distributed Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Searching in the plane
• Competitive \(k\)-server algorithms
• The theory of search games and rendezvous.
• Online searching with turn cost
• On the linear search problem
• More on the linear search problem
• Yet more on the linear search problem
• Revisiting the Problem of Searching on a Line
• Collaborative search on the plane without communication
• Optimal Constructions of Hybrid Algorithms
• Search on a Line by Byzantine Robots
• Many Random Walks Are Faster Than One
• Search on a Line with Faulty Robots
• An Optimal Search Problem

This page was built for publication: Lower bounds for searching robots, some faulty