Pages that link to "Item:Q5492864"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2005 (Q5492864):
Displaying 11 items.
- Uniform multi-agent deployment on a ring (Q627178) (← links)
- How to meet in anonymous network (Q930910) (← links)
- Asynchronous rendezvous with different maps (Q2303286) (← links)
- Asynchronous deterministic rendezvous in graphs (Q2369001) (← links)
- Black Hole Search in Directed Graphs (Q3408170) (← links)
- Asynchronous Deterministic Rendezvous on the Line (Q3599098) (← links)
- Limit Set Reachability in Asynchronous Graph Dynamical Systems (Q3646265) (← links)
- Deterministic Rendezvous in Restricted Graphs (Q5175104) (← links)
- How to meet asynchronously at polynomial cost (Q5176086) (← links)
- Random Node-Asynchronous Updates on Graphs (Q5238822) (← links)
- Time versus cost tradeoffs for deterministic rendezvous in networks (Q5964898) (← links)