Search on a line with faulty robots
DOI10.1145/2933057.2933102zbMATH Open1375.68187OpenAlexW2477849570MaRDI QIDQ5361963FDOQ5361963
Authors: Jurek Czyzowicz, Jaroslav Opatrny, Evangelos Kranakis, D. Krizanc, Lata Narayanan 
Publication date: 29 September 2017
Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2933057.2933102
Recommendations
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Parallel algorithms in computer science (68W10) Distributed systems (68M14)
Cited In (20)
- Linear rendezvous with asymmetric clocks
- Group search of the plane with faulty robots
- Bike assisted evacuation on a line
- Fault-tolerant sequential scan
- Gathering in the plane of location-aware robots in the presence of spies
- Better Upper Bounds for Searching on a Line with Byzantine Robots
- Linear search by a pair of distinct-speed robots
- Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
- Parallel searching in the plane
- Energy Consumption of Group Search on a Line
- Linear Search with Terrain-Dependent Speeds
- Time-energy tradeoffs for evacuation by two robots in the wireless model
- Querying with Uncertainty
- Optimal rendezvous on a line by location-aware robots in the presence of spies*
- Optimal circle search despite the presence of faulty robots
- Wireless evacuation on \(m\) rays with \(k\) searchers
- Search on a Line by Byzantine Robots
- Chauffeuring a crashed robot from a disk
- Evacuation of equilateral triangles by mobile agents of limited communication range
- Lower bounds for searching robots, some faulty
This page was built for publication: Search on a line with faulty robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361963)
