Approximate shared-memory counting despite a strong adversary (Q2930301): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1721837.1721841 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2168550339 / rank | |||
Normal rank | |||
Latest revision as of 20:56, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate shared-memory counting despite a strong adversary |
scientific article |
Statements
Approximate shared-memory counting despite a strong adversary (English)
0 references
18 November 2014
0 references
distributed computing
0 references
approximate counting
0 references
consensus
0 references
expanders
0 references
martingales
0 references
