Pages that link to "Item:Q5445768"
From MaRDI portal
The following pages link to Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks (Q5445768):
Displaying 4 items.
- How much memory is needed for leader election (Q661049) (← links)
- A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault (Q2303305) (← links)
- Distributed graph searching with a sense of direction (Q2355324) (← links)
- Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations (Q4602377) (← links)