Parallel algorithms for gossiping by mail (Q911271)
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: Parallel algorithms for gossiping by mail |
scientific article; zbMATH DE number 4141489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel algorithms for gossiping by mail |
scientific article; zbMATH DE number 4141489 |
Statements
Parallel algorithms for gossiping by mail (English)
0 references
1990
0 references
gossiping
0 references
one-way communication
0 references
parallel algorithms
0 references
0.8687649
0 references
0.8687649
0 references
0.86583406
0 references
0.8566709
0 references
0.85007834
0 references
0.8475735
0 references
