Communication complexity of gossiping by packets (Q1373799)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1091358
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Communication complexity of gossiping by packets |
scientific article; zbMATH DE number 1091358 |
Statements
Communication complexity of gossiping by packets (English)
0 references
17 December 1997
0 references
gossiping algorithms
0 references
0.9985160231590272
0 references
0.8457098603248596
0 references
0.8426211476325989
0 references
0.8356366157531738
0 references
