Bit complexity of breaking and achieving symmetry in chains and rings (Q3546359): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users 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/1326554.1326557 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1977127383 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:25, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bit complexity of breaking and achieving symmetry in chains and rings |
scientific article |
Statements
Bit complexity of breaking and achieving symmetry in chains and rings (English)
0 references
21 December 2008
0 references
distributed computing
0 references
communication complexity
0 references
communication cost
0 references
message complexity
0 references
bit complexity
0 references
consensus
0 references
leader election
0 references
processor chain
0 references
processor ring
0 references
tight bound
0 references
lower bounds
0 references
symmetric synchronous execution
0 references
