How to meet asynchronously at polynomial cost (Q6829773)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6410072
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
