dc.contributor.author Bracha, Gabriel en_US dc.date.accessioned 2007-04-23T16:52:53Z dc.date.available 2007-04-23T16:52:53Z dc.date.issued 1984-08 en_US dc.identifier.citation http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-631 en_US dc.identifier.uri https://hdl.handle.net/1813/6470 dc.description.abstract Byzantine Generals algorithms enable processes to reliably broadcast messages in a system of $n$ processes where up to $t$ of the processes may be faulty. The algorithms are conducted in synchronous rounds of message exchange. For a system where $n = (3 + \delta)t$ we prove the existence of a randomized algorithm whose expected number of rounds is $O(lg n)$. This is an improvement on the lower bound of $t + 1$ rounds required for deterministic algorithms and on the previous result of $t/lg n$ expected number of rounds for randomized algorithms. en_US dc.format.extent 1193556 bytes dc.format.extent 274483 bytes dc.format.mimetype application/pdf dc.format.mimetype application/postscript dc.language.iso en_US en_US dc.publisher Cornell University en_US dc.subject computer science en_US dc.subject technical report en_US dc.title An O(lg n) Expected Rounds Probabilistic Byzantine Generals Algorithm (The Bigger They Are, The Harder They Fall) en_US dc.type technical report en_US
﻿