Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
DOI10.1016/j.tcs.2017.03.018zbMath1382.68032OpenAlexW2603459283MaRDI QIDQ1686116
Michel Raynal, Hamouma Moumen, Achour Mostefaoui
Publication date: 20 December 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.03.018
coinrandomized algorithmdistributed algorithmasynchronous systemcrash failure\(k\)-set agreementmessage-passing systemByzantine processbroadcast abstractionsignature-free algorithm
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed universality
- Asynchronous byzantine agreement protocols
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- Minimal Synchrony for Byzantine Consensus
- Generalized Universality
- The topological structure of asynchronous computability
- Concurrent Programming: Algorithms, Principles, and Foundations
- Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time
- Byzantine Agreement in Expected Polynomial Time
- Conditions on input vectors for consensus solvability in asynchronous distributed systems
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Unreliable failure detectors for reliable distributed systems
- Asynchronous Agreement and Its Relation with Error-Correcting Codes
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- Generalized FLP impossibility result for t-resilient asynchronous computations
This page was built for publication: Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
