Optimal and near-optimal algorithms for \(k\)-item broadcast (Q1291007)
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: Optimal and near-optimal algorithms for k-item broadcast |
scientific article; zbMATH DE number 1295366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal and near-optimal algorithms for \(k\)-item broadcast |
scientific article; zbMATH DE number 1295366 |
Statements
Optimal and near-optimal algorithms for \(k\)-item broadcast (English)
0 references
25 January 2000
0 references
distributed-memory machines
0 references
0.7803531289100647
0 references
0.7791349291801453
0 references
0.7732198238372803
0 references
0.7700262069702148
0 references
