Fast gossiping on square mesh computers (Q1313753): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(93)90254-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2074682222 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel algorithms for gossiping by mail / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A survey of gossiping and broadcasting in communication networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Gossiping in Minimal Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3999577 / rank | |||
Normal rank | |||
Latest revision as of 11:56, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast gossiping on square mesh computers |
scientific article |
Statements
Fast gossiping on square mesh computers (English)
0 references
26 May 1994
0 references
parallel algorithms
0 references
optimal time bounds
0 references
gossiping
0 references
square mesh computers
0 references
