Tight bounds for asynchronous randomized consensus (Q3452186)
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: Tight bounds for asynchronous randomized consensus |
scientific article; zbMATH DE number 6507170
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds for asynchronous randomized consensus |
scientific article; zbMATH DE number 6507170 |
Statements
Tight bounds for asynchronous randomized consensus (English)
0 references
11 November 2015
0 references
distributed computing
0 references
isoperimetric inequality
0 references
lower bound
0 references
randomized algorithms
0 references
shared-memory
0 references
0.9866185784339904
0 references
0.8741319179534912
0 references
0.8628893494606018
0 references
0.8581914901733398
0 references
0.8469870090484619
0 references
