Pages that link to "Item:Q5901634"
From MaRDI portal
The following pages link to LATIN 2004: Theoretical Informatics (Q5901634):
Displaying 17 items.
- Strategies for parallel unaware cleaners (Q896136) (← links)
- Setting port numbers for fast graph exploration (Q935169) (← links)
- Remembering without memory: tree exploration by asynchronous oblivious robots (Q962164) (← links)
- How many oblivious robots can explore a line (Q1944194) (← links)
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols (Q1954192) (← links)
- Gossiping by energy-constrained mobile agents in tree networks (Q1998846) (← links)
- Balanced parallel exploration of orthogonal regions (Q2004877) (← links)
- On optimal coverage of a tree with multiple robots (Q2184041) (← links)
- Fast collaborative graph exploration (Q2347797) (← links)
- Map construction of unknown graphs by multiple agents (Q2456354) (← links)
- Graph exploration by a finite automaton (Q2575752) (← links)
- Communication Problems for Mobile Agents Exchanging Energy (Q2835031) (← links)
- Collective tree exploration (Q3423884) (← links)
- Energy-Optimal Broadcast in a Tree with Mobile Agents (Q5056056) (← links)
- Black hole search in common interconnection networks (Q5469124) (← links)
- Tree Exploration with an Oracle (Q5756703) (← links)
- A general lower bound for collaborative tree exploration (Q5919423) (← links)