Browsing Computer Science (CS) by Subject "bivalency"
Now showing items 1-1 of 1
-
Simple Bivalency Proofs of the Lower Bounds in Synchronous Consensus Problems
(2004-01)A fundamental problem of fault-tolerant distributed computing is for the reliable processes to reach a consensus. For a synchronous distributed system of n processes with up to t crash failures and f failures actually ...