Skip to main content alibris logo

Byzantine Agreement by Distributed Randomization in 0(log N) Rounds (Classic Reprint)

by

Write The First Customer Review
Byzantine Agreement by Distributed Randomization in 0(log N) Rounds (Classic Reprint) - Reif, John H
Filter Results
Shipping
Item Condition
Seller Rating
Other Options
Change Currency

Excerpt from Byzantine Agreement by Distributed Randomization in 0(log N) Rounds The Byzantine Agreement (ba) problem is essentially the problem of finding a protocol for reaching agreement among n distributed processes of which at most t may be faulty. BA was defined by Pease, Shostak and Lamport [psl, 80] and is essential for maintaining coordination and synchronization among processes in distributed systems. [plf, 82] showed that the BA problem has no deterministic solution in the case the processes are asynchronous. ...

loading
Byzantine Agreement by Distributed Randomization in 0(log N) Rounds (Classic Reprint) 2018, Forgotten Books

ISBN-13: 9781332904488

Trade paperback