✦ LIBER ✦

Efficient Algorithms for Anonymous Byzantine Agreement

✍ Scribed by Michael Okun; Amnon Barak

Publisher: Springer
Year: 2007
Tongue: English
Weight: 428 KB
Volume: 42
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-007-9006-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A self-adjusting algorithm for byzantine

A self-adjusting algorithm for byzantine agreement

✍ Yi Zhao; Farokh B. Bastani 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 1016 KB

Lower bound for scalable Byzantine Agree

Lower bound for scalable Byzantine Agreement

✍ Dan Holtby; Bruce M. Kapron; Valerie King 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 185 KB

Connectivity requirements for Byzantine

Connectivity requirements for Byzantine agreement under restricted types of failures

✍ Vassos Hadzilacos 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 1005 KB

Improved Algorithms for Maximum Agreemen

Improved Algorithms for Maximum Agreement and

✍ Viet Tung Hoang; Wing-Kin Sung 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 657 KB

Optimal Algorithms for Probabilistic Sol

Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings

✍ Lisa Higham; David Kirkpatrick; Karl Abrahamson; Andrew Adler 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Probabilistic algorithms are developed for a basic problem in distributed computation, assuming anonymous, asynchronous, unidirectional rings of processors. The problem, known as Solitude Detection, requires that a nonempty subset of the processors, called contenders, determine whether or not there

Message terminating algorithms for anony

Message terminating algorithms for anonymous rings of unknown size

✍ Israel Cidon; Yuval Shavitt 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 836 KB