Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed Computing (Q4635891): 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/2933575.2934567 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2531598787 / rank | |||
Normal rank | |||
Latest revision as of 20:47, 19 March 2024
scientific article; zbMATH DE number 6863505
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed Computing |
scientific article; zbMATH DE number 6863505 |
Statements
Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed Computing (English)
0 references
23 April 2018
0 references
bisimulation
0 references
distributed computing
0 references
local algorithms
0 references
lower bounds
0 references
port-numbering model
0 references
