Bit complexity of breaking and achieving symmetry in chains and rings (Q3546359)
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: Bit complexity of breaking and achieving symmetry in chains and rings |
scientific article; zbMATH DE number 5426622
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bit complexity of breaking and achieving symmetry in chains and rings |
scientific article; zbMATH DE number 5426622 |
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
0.97763824
0 references
0.8532393
0 references
0.8471197
0 references
0.8277713
0 references
0.8266865
0 references
0.82653385
0 references
