How to meet asynchronously at polynomial cost (Q5176086): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:50, 8 February 2024
scientific article; zbMATH DE number 6410072
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to meet asynchronously at polynomial cost |
scientific article; zbMATH DE number 6410072 |
Statements
How to meet asynchronously at polynomial cost (English)
0 references
2 March 2015
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
