Browsing Τμήμα Πληροφορικής / Department of Computer Science by Subject "Oblivious adversaries"
Now showing items 1-1 of 1
-
Article
Asynchronous gossip
(2013)We study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. We show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. ...