Overcoming probabilistic faults in disoriented linear search
From MaRDI portal
Publication:6148081
DOI10.1007/978-3-031-32733-9_23arXiv2303.15608OpenAlexW4377971906MaRDI QIDQ6148081
Konstantinos Georgiou, Evangelos Kranakis, Nikos Giachoudis
Publication date: 11 January 2024
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.15608
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Cites Work
- Unnamed Item
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Searching in the plane
- Theory of optimal search
- The theory of search games and rendezvous.
- Parallel searching in the plane
- Search on a line with faulty robots
- Probabilistically faulty searching on a half-line (extended abstract)
- Weighted group search on a line \& implications to the priority evacuation problem
- Online searching with turn cost
- On the linear search problem
- More on the linear search problem
- Yet more on the linear search problem
- Better Upper Bounds for Searching on a Line with Byzantine Robots
- Rendezvous search when marks are left at the starting points
- Searching for a one-dimensional random walker
- Group Search on the Line
This page was built for publication: Overcoming probabilistic faults in disoriented linear search
