Now showing items 4-5 of 5

    • Randomized Byzantine Agreement 

      Perry, Kenneth J. (Cornell University, 1984-03)
      A randomized model of distributed computation was presented in [Rabin83]. This model admits a solution to the Byzantine Agreement Problem for systems of $n$ asynchronous processes where no more than $t$ are faulty. The ...
    • Simple and Efficient Byzantine General Algorithms with Early Stopping 

      Toueg, Sam; Perry, Kenneth J.; Srikanth, T. K. (Cornell University, 1984-07)
      We describe a Byzantine Agreement algorithm, with early stopping, for systems with arbitrary process failures. The algorithm presented is simpler and more efficient than those previously known. It was derived using a ...