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

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+How to Meet Asynchronously at Polynomial Cost
@@ description / en / description / en @@
+scientific article; zbMATH DE number 6449570
@@ Property / title @@
+How to Meet Asynchronously at Polynomial Cost (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68252
@@ Property / zbMATH Open document ID: 1325.68252 / rank @@
+Normal rank
@@ Property / DOI @@
+.1137/130931990
@@ Property / DOI: 10.1137/130931990 / rank @@
+Normal rank
@@ Property / published in @@
+SIAM Journal on Computing
@@ Property / published in: SIAM Journal on Computing / rank @@
+Normal rank
@@ Property / publication date @@
+June 2015Timestamp +2015-06-24T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2015-06-24T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 24 June 2015 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6449570
@@ Property / zbMATH DE Number: 6449570 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1582826078
@@ Property / OpenAlex ID: W1582826078 / rank @@
+Normal rank
@@ Property / cites work @@
+Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
+Normal rank
@@ Property / cites work @@
+The Rendezvous Search Problem
@@ Property / cites work: The Rendezvous Search Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Rendezvous search on labeled networks
@@ Property / cites work: Rendezvous search on labeled networks / rank @@
+Normal rank
@@ Property / cites work @@
+Rendezvous search on a graph
@@ Property / cites work: Rendezvous search on a graph / rank @@
+Normal rank
@@ Property / cites work @@
+The theory of search games and rendezvous.
@@ Property / cites work: The theory of search games and rendezvous. / rank @@
+Normal rank
@@ Property / cites work @@
+Two Dimensional Rendezvous Search
@@ Property / cites work: Two Dimensional Rendezvous Search / rank @@
+Normal rank
@@ Property / cites work @@
+The rendezvous problem on discrete locations
@@ Property / cites work: The rendezvous problem on discrete locations / rank @@
+Normal rank
@@ Property / cites work @@
+A single-version STM that is multi-versioned permissive
+Normal rank
@@ Property / cites work @@
+Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
+Normal rank
@@ Property / cites work @@
+Rendezvous search when marks are left at the starting points
+Normal rank
@@ Property / cites work @@
+Distributed Computing by Mobile Robots: Gathering
@@ Property / cites work: Distributed Computing by Mobile Robots: Gathering / rank @@
+Normal rank
@@ Property / cites work @@
+Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
+Normal rank
@@ Property / cites work @@
+Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
+Normal rank
@@ Property / cites work @@
+Tell Me Where I Am So I Can Meet You Sooner
@@ Property / cites work: Tell Me Where I Am So I Can Meet You Sooner / rank @@
+Normal rank
@@ Property / cites work @@
+How to meet when you forget: log-space rendezvous in arbitrary graphs
+Normal rank
@@ Property / cites work @@
+How to meet asynchronously (almost) everywhere
@@ Property / cites work: How to meet asynchronously (almost) everywhere / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic rendezvous in graphs
@@ Property / cites work: Deterministic rendezvous in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
+Normal rank
@@ Property / cites work @@
+Anonymous Meeting in Networks
@@ Property / cites work: Anonymous Meeting in Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Gathering Despite Mischief
@@ Property / cites work: Gathering Despite Mischief / rank @@
+Normal rank
@@ Property / cites work @@
+Gathering of asynchronous robots with limited visibility
+Normal rank
@@ Property / cites work @@
+Methods and problems of communication in usual networks
+Normal rank
@@ Property / cites work @@
+Decidability Classes for Mobile Agents Computing
@@ Property / cites work: Decidability Classes for Mobile Agents Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Delays Induce an Exponential Memory Gap for Rendezvous in Trees
+Normal rank
@@ Property / cites work @@
+How to meet in anonymous network
@@ Property / cites work: How to meet in anonymous network / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized rendezvous with limited memory
@@ Property / cites work: Randomized rendezvous with limited memory / rank @@
+Normal rank
@@ Property / cites work @@
+LATIN 2004: Theoretical Informatics
@@ Property / cites work: LATIN 2004: Theoretical Informatics / rank @@
+Normal rank
@@ Property / cites work @@
+Minimax Rendezvous on the Line
@@ Property / cites work: Minimax Rendezvous on the Line / rank @@
+Normal rank
@@ Property / cites work @@
+Q3126969
@@ Property / cites work: Q3126969 / rank @@
+Normal rank
@@ Property / cites work @@
+Asynchronous deterministic rendezvous in graphs
@@ Property / cites work: Asynchronous deterministic rendezvous in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
+Normal rank
@@ Property / cites work @@
+Q4818870
@@ Property / cites work: Q4818870 / rank @@
+Normal rank