Election in fully anonymous shared memory systems: tight space bounds and algorithms (Q2097346)
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 7615857
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Election in fully anonymous shared memory systems: tight space bounds and algorithms |
scientific article; zbMATH DE number 7615857 |
Statements
Election in fully anonymous shared memory systems: tight space bounds and algorithms (English)
0 references
11 November 2022
0 references
anonymous processes
0 references
anonymous memory
0 references
distributed computability
0 references
leader election
0 references
process participation
0 references
read-write register
0 references
read-modify-write register
0 references
symmetry-breaking
0 references
tight bounds
0 references
0 references
0.9193541
0 references
0.85949564
0 references
0.8547461
0 references
0.8497607
0 references
0.8491707
0 references
0.8483294
0 references
0.8440704
0 references
