The following pages link to STACS 2004 (Q5309704):
Displayed 19 items.
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- How much memory is needed for leader election (Q661049) (← links)
- Distributed chasing of network intruders (Q930899) (← links)
- Fast periodic graph exploration with constant memory (Q931724) (← links)
- Setting port numbers for fast graph exploration (Q935169) (← links)
- Impact of memory size on graph exploration capability (Q947116) (← links)
- How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
- Exploring sparse graphs with advice (Q2105435) (← links)
- A tight lower bound for semi-synchronous collaborative grid exploration (Q2220396) (← links)
- Building a nest by an automaton (Q2223695) (← links)
- Map construction of unknown graphs by multiple agents (Q2456354) (← links)
- Graph exploration by a finite automaton (Q2575752) (← links)
- Black Hole Search in Directed Graphs (Q3408170) (← links)
- On the Power of Local Orientations (Q3511395) (← links)
- (Q5075773) (← links)
- A tight lower bound for semi-synchronous collaborative grid exploration (Q5090903) (← links)
- Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)
- Black hole search in common interconnection networks (Q5469124) (← links)
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots (Q5918539) (← links)