A probabilistic characterization of a fault-tolerant gossiping algorithm (Q1044771): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s11424-009-9149-7 / rank | |||
Property / author | |||
Property / author: Paul A. Parker / rank | |||
Property / author | |||
Property / author: Paul A. Parker / rank | |||
Normal rank | |||
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.1007/s11424-009-9149-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2033459027 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Correctness of a gossip based membership protocol / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2766881 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4101645 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Spatial gossip and resource location protocols / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4862631 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fault-tolerant broadcasting and gossiping in communication networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Feasibility and complexity of broadcasting with random transmission failures / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S11424-009-9149-7 / rank | |||
Normal rank |
Latest revision as of 14:47, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A probabilistic characterization of a fault-tolerant gossiping algorithm |
scientific article |
Statements
A probabilistic characterization of a fault-tolerant gossiping algorithm (English)
0 references
15 December 2009
0 references
fault-tolerance
0 references
gossip
0 references
probabilistic broadcast
0 references
reliable multicast
0 references