Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks (Q3210138)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks |
scientific article; zbMATH DE number 4191074
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks |
scientific article; zbMATH DE number 4191074 |
Statements
Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks (English)
0 references
1991
0 references
complete networks
0 references
distributed algorithms
0 references
leader election algorithms
0 references
time-message complexities trade-off
0 references
0.8863808
0 references
0.88623524
0 references
0.8690448
0 references
0.8690448
0 references
0 references
0.85326695
0 references
0.85244745
0 references
