How to meet asynchronously at polynomial cost (Q5176086): Difference between revisions
From MaRDI portal
Changed an Item |
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
||
| description / en | description / en | ||
Revision as of 15:13, 2 May 2024
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to meet asynchronously at polynomial cost |
No description defined |
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
