Computing on rings by oblivious robots: a unified approach for different tasks (Q494795): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62046032, #quickstatements; #temporary_batch_1712286835472
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Tree exploration with logarithmic memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anonymous graph exploration without collision by mobile robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of gathering by a set of autonomous mobile robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity in graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exclusive Perpetual Ring Exploration without Chirality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exclusive Graph Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy-efficient strategies for building short chains of mobile robots locally / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cost of probabilistic agreement in oblivious robot networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Label-guided graph exploration by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering few fat mobile robots in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering six oblivious robots on anonymous symmetric rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering of robots on anonymous grids and trees without multiplicity detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Gather Asynchronous Oblivious Robots on Anonymous Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remembering without memory: tree exploration by asynchronous oblivious robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing by Mobile Robots: Gathering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing without communicating: ring exploration by asynchronous oblivious robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on guaranteed graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cost of monotonicity in distributed graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering asynchronous oblivious mobile robots in a ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring / rank
 
Normal rank

Latest revision as of 17:48, 10 July 2024

scientific article
Language Label Description Also known as
English
Computing on rings by oblivious robots: a unified approach for different tasks
scientific article

    Statements

    Computing on rings by oblivious robots: a unified approach for different tasks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 September 2015
    0 references
    0 references
    distributed computing
    0 references
    exploration
    0 references
    searching
    0 references
    gathering
    0 references
    oblivious anonymous robots
    0 references
    asynchronous anonymous networks
    0 references
    look-compute-move
    0 references
    0 references
    0 references