Meeting the deadline: on the complexity of fault-tolerant continuous gossip (2011)
Attributed to:
Reliable Distributed Algorithms for Dynamic Communication in Ad Hoc Networks
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/s00446-011-0144-6
Publication URI: http://dx.doi.org/10.1007/s00446-011-0144-6
Type: Journal Article/Review
Parent Publication: Distributed Computing
Issue: 5