Almost-optimal gossip-based aggregate computation (Q2910849)
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: Almost-optimal gossip-based aggregate computation |
scientific article; zbMATH DE number 6081202
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost-optimal gossip-based aggregate computation |
scientific article; zbMATH DE number 6081202 |
Statements
12 September 2012
0 references
gossip-based protocol
0 references
aggregate functions
0 references
aggregate computation
0 references
message complexity
0 references
time complexity
0 references
peer-to-peer networks
0 references
sparse communication networks
0 references
distribution random ranking
0 references
address-oblivious algorithm
0 references
non-address-oblivious algorithm
0 references
0.92998505
0 references
0.9136462
0 references
0.9054102
0 references
0.89437747
0 references
0.88795614
0 references
Almost-optimal gossip-based aggregate computation (English)
0 references
