A deterministic worst-case message complexity optimal solution for resource discovery (Q2345458)
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: A deterministic worst-case message complexity optimal solution for resource discovery |
scientific article; zbMATH DE number 6438850
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A deterministic worst-case message complexity optimal solution for resource discovery |
scientific article; zbMATH DE number 6438850 |
Statements
A deterministic worst-case message complexity optimal solution for resource discovery (English)
0 references
22 May 2015
0 references
distributed algorithms
0 references
resource discovery
0 references
self-stabilization
0 references
clique network
0 references
0 references
0 references
0.999141275882721
0 references
0.8201988935470581
0 references
0.8193954229354858
0 references
0.8162096738815308
0 references
0.8143028616905212
0 references
