scientific article; zbMATH DE number 7561443

DOI10.4230/LIPICS.OPODIS.2018.15MaRDI QIDQ5091088

Signe Rüsch, Bijun Li, Wen-Bo Xu, Rüdiger Kapitza

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

fault tolerancedistributed systemconsensus

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Cites Work

• The correctness proof of Ben-Or's randomized consensus algorithm
• An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience
• Impossibility of distributed consensus with one faulty process
• Fast asynchronous Byzantine agreement with optimal resilience
• Efficient Byzantine Fault-Tolerance

This page was built for publication: