Optimal tradeoffs between time and bit complexity in distributed synchronous rings (Q4035677)
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 176511
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal tradeoffs between time and bit complexity in distributed synchronous rings |
scientific article; zbMATH DE number 176511 |
Statements
18 May 1993
0 references
rings of processors
0 references
leader election
0 references
bit complexity
0 references
lower bounds
0 references
0.8939715027809143
0 references
0.8525999188423157
0 references
0.8463089466094971
0 references
0.839247465133667
0 references
0.8200674653053284
0 references
Optimal tradeoffs between time and bit complexity in distributed synchronous rings (English)
0 references
