The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks (Q2407630): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59603455, #quickstatements; #temporary_batch_1711196317277
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the last new vertex visited by a random walk / 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: Disks, Balls, and Walls: Analysis of a Combinatorial Game / 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: Robustness of the rotor-router mechanism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Analysis of Deterministic Load-Balancing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traversing Directed Eulerian Mazes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trading Space for Time in Undirected <i>s</i>-<i>t</i> Connectivity / 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: 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: Graph exploration by a finite automaton / 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: Memory Efficient Anonymous Graph Exploration / 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: 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 11:54, 14 July 2024

scientific article
Language Label Description Also known as
English
The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks
scientific article

    Statements

    The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 October 2017
    0 references

    Identifiers