How to meet asynchronously at polynomial cost (Q5176086): Difference between revisions

From MaRDI portal
Merged Item from Q5258918
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rendezvous Search Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous search on labeled networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rendezvous search on a graph / 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: Two Dimensional Rendezvous Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rendezvous problem on discrete locations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A single-version STM that is multi-versioned permissive / 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: Rendezvous search when marks are left at the starting points / 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: Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements / 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: How to meet when you forget: log-space rendezvous in arbitrary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to meet asynchronously (almost) everywhere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic rendezvous in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anonymous Meeting in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering Despite Mischief / 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: Methods and problems of communication in usual networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability Classes for Mobile Agents Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delays Induce an Exponential Memory Gap for Rendezvous in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to meet in anonymous network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized rendezvous with limited memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax Rendezvous on the Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous deterministic rendezvous in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818870 / rank
 
Normal rank

Latest revision as of 08:56, 10 July 2024

scientific article; zbMATH DE number 6449570
  • How to Meet Asynchronously at Polynomial Cost
Language Label Description Also known as
English
How to meet asynchronously at polynomial cost
scientific article; zbMATH DE number 6449570
  • How to Meet Asynchronously at Polynomial Cost

Statements

How to meet asynchronously at polynomial cost (English)
0 references
How to Meet Asynchronously at Polynomial Cost (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
2 March 2015
0 references
24 June 2015
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
asynchronous mobile agents
0 references
deterministic algorithm
0 references
gossiping
0 references
leader election
0 references
network
0 references
renaming
0 references
rendezvous
0 references
0 references
0 references
0 references
0 references
0 references