Meeting the deadline: on the complexity of fault-tolerant continuous gossip (Q661066)
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: Meeting the deadline: on the complexity of fault-tolerant continuous gossip |
scientific article; zbMATH DE number 6003530
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Meeting the deadline: on the complexity of fault-tolerant continuous gossip |
scientific article; zbMATH DE number 6003530 |
Statements
Meeting the deadline: on the complexity of fault-tolerant continuous gossip (English)
0 references
6 February 2012
0 references
gossip
0 references
crashes and restarts
0 references
dynamic rumor injection
0 references
random and expander graphs
0 references
