On the complexity of asynchronous gossip (Q2934340)
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 6379950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of asynchronous gossip |
scientific article; zbMATH DE number 6379950 |
Statements
On the complexity of asynchronous gossip (English)
0 references
12 December 2014
0 references
adaptive versus oblivious adversary
0 references
asynchrony
0 references
complexity
0 references
consensus
0 references
epidemic
0 references
gossip
0 references
randomization
0 references
0.7308173775672913
0 references
0.723995566368103
0 references
0.7197774648666382
0 references
0.7156689167022705
0 references
