Pages that link to "Item:Q2849311"
From MaRDI portal
The following pages link to Revisiting the Problem of Searching on a Line (Q2849311):
Displaying 11 items.
- Lower bounds for searching robots, some faulty (Q1981629) (← links)
- Search on a line with faulty robots (Q2010608) (← links)
- Priority evacuation from a disk: the case of \(n \geq 4\) (Q2210503) (← links)
- Multi-processor search and scheduling problems with setup cost (Q2398209) (← links)
- Searching on a line: a complete characterization of the optimal solution (Q2513671) (← links)
- Exploration of High-Dimensional Grids by Finite Automata (Q5092342) (← links)
- Linear Search with Terrain-Dependent Speeds (Q5283387) (← links)
- Fast two-robot disk evacuation with wireless communication (Q5915701) (← links)
- Search on a Line by Byzantine Robots (Q6114825) (← links)
- Deterministic treasure hunt and rendezvous in arbitrary connected graphs (Q6195335) (← links)
- Exploration of High-Dimensional Grids by Finite State Machines (Q6492093) (← links)
