Sublinear bounds for randomized leader election (Q477103)
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: Sublinear bounds for randomized leader election |
scientific article; zbMATH DE number 6665665
- Sublinear Bounds for Randomized Leader Election
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sublinear bounds for randomized leader election |
scientific article; zbMATH DE number 6665665 |
|
Statements
Sublinear bounds for randomized leader election (English)
0 references
Sublinear Bounds for Randomized Leader Election (English)
0 references
2 December 2014
0 references
19 December 2016
0 references
distributed algorithm
0 references
leader election
0 references
randomization
0 references
lower bound
0 references
0 references
0.9948179721832277
0 references
0.9141780734062196
0 references
0.913390338420868
0 references
0.908903419971466
0 references
0.8688578605651855
0 references
