Pages that link to "Item:Q5199503"
From MaRDI portal
The following pages link to Many Random Walks Are Faster Than One (Q5199503):
Displaying 25 items.
- Bounds on the cover time of parallel rotor walks (Q269498) (← links)
- Spanders: distributed spanning expanders (Q395654) (← links)
- Random walks, bisections and gossiping in circulant graphs (Q486995) (← links)
- Tight bounds for the cover time of multiple random walks (Q541669) (← links)
- Active exploration for large graphs (Q1741157) (← links)
- Lower bounds for searching robots, some faulty (Q1981629) (← links)
- Broadcasting on paths and cycles (Q2138979) (← links)
- On an epidemic model on finite graphs (Q2180383) (← 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)
- Distributed computation in dynamic networks via random walks (Q2345448) (← links)
- The ANTS problem (Q2401118) (← links)
- Searching without communicating: tradeoffs between performance and selection complexity (Q2401119) (← links)
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks (Q2407630) (← links)
- The cover time of a (multiple) Markov chain with rational transition probabilities is rational (Q2670806) (← links)
- Collective search and decision-making for target localization (Q3168231) (← links)
- The Hitting Time of Multiple Random Walks (Q3185674) (← links)
- Coalescing Walks on Rotor-Router Systems (Q3460734) (← links)
- Motifs for Processes on Networks (Q5023532) (← links)
- Analytical results for the distribution of cover times of random walks on random regular graphs (Q5049469) (← links)
- Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)
- Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks (Q5391132) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
- A general lower bound for collaborative tree exploration (Q5919423) (← links)
- Multiple random walks on graphs: mixing few to cover many (Q6085870) (← links)
