Parallel algorithms for gossiping by mail (Q911271): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Gossips and telegraphs / 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: New gossips and telephones / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3744177 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Information Dissemination in Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A data structure for manipulating priority queues / rank | |||
Normal rank |
Latest revision as of 15:06, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Parallel algorithms for gossiping by mail |
scientific article |
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