Bounds on the cover time of parallel rotor walks (Q269498): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2016.01.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2293335601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many Random Walks Are Faster Than One / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euler Tour Lock-In Problem in the Rotor-Router Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traversing Directed Eulerian Mazes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing random walks in undirected graphs using locally fair exploration strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating a Random Walk with Constant Error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Cover Time of Parallel Rotor Walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Random Walks on the Two-Dimensional Grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Well Do Random Walks Parallelize? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for the cover time of multiple random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectrum of time-space trade-offs for undirected \(s-t\) connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cover time of deterministic random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-agent rotor-router on the ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spherical asymptotics for the rotor-router model in $\mathbb{Z}^d$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rotor-router shape is spherical / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong spherical asymptotics for rotor-router aggregation and the divisible sandpile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expansion and the cover time of parallel random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed ant algorithm for efficiently patrolling a network / rank
 
Normal rank

Latest revision as of 19:17, 11 July 2024

scientific article
Language Label Description Also known as
English
Bounds on the cover time of parallel rotor walks
scientific article

    Statements

    Bounds on the cover time of parallel rotor walks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 April 2016
    0 references
    distributed graph exploration
    0 references
    rotor-router
    0 references
    cover time
    0 references
    collaborative robots
    0 references
    parallel random walks
    0 references
    derandomization
    0 references

    Identifiers