Pages that link to "Item:Q4636509"
From MaRDI portal
The following pages link to Search on a Line by Byzantine Robots (Q4636509):
Displaying 18 items.
- Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots (Q820545) (← links)
- Linear search by a pair of distinct-speed robots (Q1755792) (← links)
- Lower bounds for searching robots, some faulty (Q1981629) (← links)
- Byzantine gathering in polynomial time (Q2146872) (← links)
- Online searching with an autonomous robot (Q2489019) (← links)
- Better Upper Bounds for Searching on a Line with Byzantine Robots (Q3297827) (← links)
- (Q5002836) (← links)
- Querying with Uncertainty (Q5056054) (← links)
- (Q5090453) (← links)
- Energy Consumption of Group Search on a Line (Q5092340) (← links)
- Byzantine fault tolerant symmetric-persistent circle evacuation (Q5918713) (← links)
- Gathering in the plane of location-aware robots in the presence of spies (Q5918903) (← links)
- Time-energy tradeoffs for evacuation by two robots in the wireless model (Q5919064) (← links)
- Wireless evacuation on \(m\) rays with \(k\) searchers (Q5919422) (← links)
- Byzantine fault tolerant symmetric-persistent circle evacuation (Q5925703) (← links)
- Best-of-both-worlds analysis of online search (Q6066770) (← links)
- Optimal circle search despite the presence of faulty robots (Q6161451) (← links)
- Chauffeuring a crashed robot from a disk (Q6536162) (← links)