Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed Computing (Q4635891)
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: Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed Computing |
scientific article; zbMATH DE number 6863505
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.87579435
0 references
0.84494466
0 references
0.8393569
0 references
0.8379673
0 references
0.8355782
0 references
0.8292811
0 references
0.8292563
0 references