Meeting the deadline: On the complexity of fault-tolerant continuous gossip

10.1007/s00446-011-0144-6

Saved in:

Bibliographic Details
Main Authors:	Georgiou, C., Gilbert, S., Kowalski, D.R.
Other Authors:	COMPUTER SCIENCE
Format:	Article
Published:	2013
Subjects:	Crashes and restarts Dynamic rumor injection Gossip Random and expander graphs
Online Access:	http://scholarbank.nus.edu.sg/handle/10635/39152
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	National University of Singapore

id	sg-nus-scholar.10635-39152
record_format	dspace
spelling	sg-nus-scholar.10635-391522023-10-29T20:16:11Z Meeting the deadline: On the complexity of fault-tolerant continuous gossip Georgiou, C. Gilbert, S. Kowalski, D.R. COMPUTER SCIENCE Crashes and restarts Dynamic rumor injection Gossip Random and expander graphs 10.1007/s00446-011-0144-6 Distributed Computing 24 5 223-244 DICOE 2013-07-04T07:35:08Z 2013-07-04T07:35:08Z 2011 Article Georgiou, C., Gilbert, S., Kowalski, D.R. (2011). Meeting the deadline: On the complexity of fault-tolerant continuous gossip. Distributed Computing 24 (5) : 223-244. ScholarBank@NUS Repository. https://doi.org/10.1007/s00446-011-0144-6 01782770 http://scholarbank.nus.edu.sg/handle/10635/39152 000297518000002 Scopus
institution	National University of Singapore
building	NUS Library
continent	Asia
country	Singapore Singapore
content_provider	NUS Library
collection	ScholarBank@NUS
topic	Crashes and restarts Dynamic rumor injection Gossip Random and expander graphs
spellingShingle	Crashes and restarts Dynamic rumor injection Gossip Random and expander graphs Georgiou, C. Gilbert, S. Kowalski, D.R. Meeting the deadline: On the complexity of fault-tolerant continuous gossip
description	10.1007/s00446-011-0144-6
author2	COMPUTER SCIENCE
author_facet	COMPUTER SCIENCE Georgiou, C. Gilbert, S. Kowalski, D.R.
format	Article
author	Georgiou, C. Gilbert, S. Kowalski, D.R.
author_sort	Georgiou, C.
title	Meeting the deadline: On the complexity of fault-tolerant continuous gossip
title_short	Meeting the deadline: On the complexity of fault-tolerant continuous gossip
title_full	Meeting the deadline: On the complexity of fault-tolerant continuous gossip
title_fullStr	Meeting the deadline: On the complexity of fault-tolerant continuous gossip
title_full_unstemmed	Meeting the deadline: On the complexity of fault-tolerant continuous gossip
title_sort	meeting the deadline: on the complexity of fault-tolerant continuous gossip
publishDate	2013
url	http://scholarbank.nus.edu.sg/handle/10635/39152
_version_	1781410980389978112

Meeting the deadline: On the complexity of fault-tolerant continuous gossip

Similar Items