Pages that link to "Item:Q5090903"
From MaRDI portal
The following pages link to A tight lower bound for semi-synchronous collaborative grid exploration (Q5090903):
Displaying 8 items.
- Weighted group search on a line \& implications to the priority evacuation problem (Q2098167) (← links)
- Building a nest by an automaton (Q2223695) (← links)
- Energy Consumption of Group Search on a Line (Q5092340) (← links)
- Exploration of High-Dimensional Grids by Finite Automata (Q5092342) (← links)
- A general lower bound for collaborative tree exploration (Q5919423) (← links)
- Algorithms for \(p\)-Faulty Search on a half-line (Q6174824) (← links)
- Exploration of High-Dimensional Grids by Finite State Machines (Q6492093) (← links)
- Graph exploration by a deterministic memoryless automaton with pebbles (Q6585255) (← links)