A probabilistic characterization of a fault-tolerant gossiping algorithm (Q1044771)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5647878
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A probabilistic characterization of a fault-tolerant gossiping algorithm |
scientific article; zbMATH DE number 5647878 |
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
0.7696346044540405
0 references
0.7605387568473816
0 references
0.760403037071228
0 references
0.7603499293327332
0 references
