Better Upper Bounds for Searching on a Line with Byzantine Robots (Q3297827)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Better Upper Bounds for Searching on a Line with Byzantine Robots |
scientific article |
Statements
Better Upper Bounds for Searching on a Line with Byzantine Robots (English)
0 references
20 July 2020
0 references
searching on a line
0 references
mobile robots
0 references
parallel search
0 references
competitive ratio
0 references
Byzantine fault
0 references
0 references
