Gathering on rings under the look-compute-move model (Q2256947): 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.1007/s00446-014-0212-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030789557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rendezvous Search Problem / 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: Exclusive 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: Rendezvous of Mobile Agents without Agreement on Local Orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach for Analyzing Convergence Algorithms for Mobile Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417602 / 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: Gathering six oblivious robots on anonymous symmetric rings / 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: Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring / 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: Deterministic rendezvous in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Gathering of Oblivious Robots in Anonymous Graphs / 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: Gathering of asynchronous robots with limited visibility / 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: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns / rank
 
Normal rank

Latest revision as of 18:10, 9 July 2024

scientific article
Language Label Description Also known as
English
Gathering on rings under the look-compute-move model
scientific article

    Statements

    Gathering on rings under the look-compute-move model (English)
    0 references
    0 references
    0 references
    0 references
    23 February 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    distributed algorithm
    0 references
    asynchronous system
    0 references
    gathering
    0 references
    oblivious robots
    0 references
    0 references
    0 references