Abstract
A recent theoretical result by King and Saia shows that it is possible to solve the Byzantine agreement, leader election and universe reduction problems in the full information model with Õ(n
2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)
Like what you’re reading?
Already a member?
Related Articles
- Optimistic Byzantine Agreement
Reliable Distributed Systems, IEEE Symposium on - The Weighted Byzantine Agreement Problem
Parallel and Distributed Processing Symposium, International - Voting in the Presence of Byzantine Faults
2017 IEEE 22nd Pacific Rim International Symposium on Dependable Computing (PRDC) - Approximate Agreement under Mobile Byzantine Faults
2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS) - Byzantine agreement in constant expected time
26th Annual Symposium on Foundations of Computer Science (sfcs 1985) - Randomized Byzantine Agreement
IEEE Transactions on Software Engineering - Degradable Byzantine Agreement
IEEE Transactions on Computers - Byzantine Agreement with Interval Validity
2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS) - Byzantine Generalized Lattice Agreement
2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS) - Polygraph: Accountable Byzantine Agreement
2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)