Back to Results
First PageMeta Content
Concurrent computing / Computing / Consensus / Distributed computing / Distributed data storage / Distributed algorithms


Exercise 4: Extreme Democracy Task 1: Everyone Gets exactly one Vote. . . The goal of this exercise is to prove correct the asynchronous safe broadcast algorithm by Bracha. It tolerates f < n/3 Byzantine faults, so we wi
Add to Reading List

Document Date: 2014-11-12 04:29:30


Open Document

File Size: 125,79 KB

Share Result on Facebook