On asynchronous rendezvous in general graphs (Q1625604): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2018.06.045 / rank
Normal rank
 
Property / author
 
Property / author: Maria Gradinariu Potop-Butucaru / rank
Normal rank
 
Property / author
 
Property / author: Maria Gradinariu Potop-Butucaru / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2884716215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of search games and rendezvous. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronous gathering without multiplicity detection: a certified algorithm / 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: Wait-Free Gathering Without Chirality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing by Mobile Robots: Gathering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tell Me Where I Am So I Can Meet You Sooner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to meet asynchronously (almost) everywhere / 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: Asynchronous deterministic rendezvous in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant and Self-stabilizing Mobile Robots Gathering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anonymous meeting in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to meet asynchronously at polynomial cost / 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: Gathering fat mobile robots with slim omnidirectional cameras / 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: Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring / 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: Impossibility of gathering by a set of autonomous mobile robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Deterministic Rendezvous on the Line / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129413548 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2018.06.045 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:28, 10 December 2024

scientific article
Language Label Description Also known as
English
On asynchronous rendezvous in general graphs
scientific article

    Statements

    On asynchronous rendezvous in general graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 November 2018
    0 references
    distributed algorithms
    0 references
    asynchronous
    0 references
    mobile agents
    0 references
    general graphs
    0 references
    rendezvous
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references