Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots (Q3511387): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exploring Unknown Environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Algorithms for Autonomous Robot Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal graph exploration without good maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / 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: Q2934641 / 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: Exploring Unknown Undirected Graphs / 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: Q4348608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns / rank
 
Normal rank

Latest revision as of 13:13, 28 June 2024

scientific article
Language Label Description Also known as
English
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
scientific article

    Statements