Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks (Q3210138)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks |
scientific article |
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
