Lower bounds for searching robots, some faulty
type: Item
instance of: scholarly article
title: Lower bounds for searching robots, some faulty
author: Andrey B. Kupavskii
author: Emo Welzl
published in: Distributed Computing
publication date: 2021-09-06T00:00:00Z
full work available at URL: https://arxiv.org/abs/1707.05077
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 7391411
MaRDI profile type: Publication
OpenAlex ID: W2965001836
cites work: Many Random Walks Are Faster Than One
cites work: The theory of search games and rendezvous.
cites work: Q3140447
cites work: Searching in the plane
cites work: On the linear search problem
cites work: More on the linear search problem
cites work: Yet more on the linear search problem
cites work: Revisiting the Problem of Searching on a Line
cites work: Search on a Line by Byzantine Robots
cites work: Search on a Line with Faulty Robots
cites work: Online searching with turn cost
cites work: Collaborative search on the plane without communication
cites work: Competitive \(k\)-server algorithms
cites work: An Optimal Search Problem
cites work: Optimal Constructions of Hybrid Algorithms
cites work: Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
cites work: Q4413802
DOI: 10.1007/S00446-019-00358-Y
description: scientific article; zbMATH DE number 7391411