Pages that link to "Item:Q1356886"
From MaRDI portal
The following pages link to A spectrum of time-space trade-offs for undirected \(s-t\) connectivity (Q1356886):
Displaying 8 items.
- Bounds on the cover time of parallel rotor walks (Q269498) (← links)
- Time-space tradeoffs for undirected graph traversal by graph automata (Q675049) (← links)
- Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space (Q677988) (← links)
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks (Q2407630) (← links)
- Trading Space for Time in Undirected <i>s</i>-<i>t</i> Connectivity (Q4291560) (← links)
- Many Random Walks Are Faster Than One (Q5199503) (← links)
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits (Q5402558) (← links)
- Multiple random walks on graphs: mixing few to cover many (Q6085870) (← links)