Pages that link to "Item:Q3188999"
From MaRDI portal
The following pages link to Tree exploration with logarithmic memory (Q3188999):
Displayed 19 items.
- Deterministic network exploration by a single agent with Byzantine tokens (Q436569) (← links)
- Computing on rings by oblivious robots: a unified approach for different tasks (Q494795) (← links)
- Derandomizing random walks in undirected graphs using locally fair exploration strategies (Q661051) (← links)
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530) (← links)
- On mobile agent verifiable problems (Q1753994) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Energy-optimal broadcast and exploration in a tree using mobile agents (Q2330122) (← links)
- Distributed graph searching with a sense of direction (Q2355324) (← links)
- Computing without communicating: ring exploration by asynchronous oblivious robots (Q2392925) (← links)
- The ANTS problem (Q2401118) (← links)
- Searching without communicating: tradeoffs between performance and selection complexity (Q2401119) (← links)
- Robustness of the rotor-router mechanism (Q2408092) (← links)
- (Q5002857) (← links)
- Energy-Optimal Broadcast in a Tree with Mobile Agents (Q5056056) (← links)
- Exploration of Time-Varying Connected Graphs with Silent Agents (Q5100956) (← links)
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots (Q5918539) (← links)
- A general lower bound for collaborative tree exploration (Q5919423) (← links)
- Time versus cost tradeoffs for deterministic rendezvous in networks (Q5964898) (← links)
- Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles (Q6155234) (← links)