Communication complexity of quasirandom rumor spreading (Q2354024)
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 6457225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Communication complexity of quasirandom rumor spreading |
scientific article; zbMATH DE number 6457225 |
Statements
Communication complexity of quasirandom rumor spreading (English)
0 references
10 July 2015
0 references
randomized algorithm
0 references
broadcasting
0 references
parallel computing
0 references
0 references
0.9928776025772096
0 references
0.8967827558517456
0 references
0.874042809009552
0 references
0.8709055185317993
0 references
0.8583037853240967
0 references
