Minimizing message complexity of partially replicated data on hypercubes (Q5689820)
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: Minimizing message complexity of partially replicated data on hypercubes |
scientific article; zbMATH DE number 961974
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing message complexity of partially replicated data on hypercubes |
scientific article; zbMATH DE number 961974 |
Statements
25 May 1997
0 references
hypercube
0 references
Minimizing message complexity of partially replicated data on hypercubes (English)
0 references
0.8771739
0 references
0.8567256
0 references
0 references
0.8465376
0 references
0.8450511
0 references
0.84339875
0 references