Meeting the deadline: on the complexity of fault-tolerant continuous gossip (Q661066): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:52, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Meeting the deadline: on the complexity of fault-tolerant continuous gossip |
scientific article |
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
