How to Meet Asynchronously at Polynomial Cost (Q5258918): Difference between revisions
From MaRDI portal
Item:Q5258918
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:52, 8 February 2024
scientific article; zbMATH DE number 6449570
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to Meet Asynchronously at Polynomial Cost |
scientific article; zbMATH DE number 6449570 |
Statements
How to Meet Asynchronously at Polynomial Cost (English)
0 references
24 June 2015
0 references
asynchronous mobile agents
0 references
network
0 references
rendezvous
0 references
deterministic algorithm
0 references
leader election
0 references
renaming
0 references
gossiping
0 references
