Pages that link to "Item:Q3646241"
From MaRDI portal
The following pages link to Euler Tour Lock-In Problem in the Rotor-Router Model (Q3646241):
Displaying 15 items.
- Bounds on the cover time of parallel rotor walks (Q269498) (← links)
- Derandomizing random walks in undirected graphs using locally fair exploration strategies (Q661051) (← links)
- Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots (Q820545) (← links)
- Total variation discrepancy of deterministic random walks for ergodic Markov chains (Q1675930) (← links)
- Dispersion of mobile robots on directed anonymous graphs (Q2097347) (← links)
- The cover time of deterministic random walks for general transition probabilities (Q2310755) (← links)
- Does adding more agents make a difference? A case study of cover time for the rotor-router (Q2323346) (← links)
- Time and space optimality of rotor-router graph exploration (Q2398496) (← links)
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks (Q2407630) (← links)
- Distributed Patrolling with Two-Speed Robots (and an Application to Transportation) (Q2980175) (← links)
- Coalescing Walks on Rotor-Router Systems (Q3460734) (← links)
- The Range of a Rotor Walk (Q4576529) (← links)
- Deterministic Random Walks for Rapidly Mixing Chains (Q4584953) (← links)
- Unbounded Discrepancy of Deterministic Random Walks on Grids (Q4691168) (← links)
- Fast dispersion of mobile robots on arbitrary graphs (Q6536152) (← links)
