Output details
11 - Computer Science and Informatics
University of Liverpool
Article title
Asynchronous gossip
Type
D - Journal article
Title of journal
Journal of the ACM
Article number
-
Volume number
60
Issue number
2
First page of article
1
ISSN of journal
00045411
Year of publication
2013
URL
-
Number of additional authors
3
Additional information
<12>This article is based on the conference paper "On the complexity of asynchronous gossip" published at PODC'2008. It studies fault-tolerant message-passing communication in asynchronous systems with processor crashes. Algorithmic ideas developed in this work have been used in various settings and applied to reduce messages in other distributed tasks such as consensus, Alistarh et al. [ICALP'2010] and Wing-Hei Luk et al. [Journal of Internet Services and Applications'2013]. The majority gossip problem introduced in this work has been further generalised and studied by Censor-Hillel and Shachnai [PODC'2010].
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
