12 citations · 19 across the 2 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2017★ 12 cited
DBFT: Efficient Byzantine Consensus with a Weak Coordinator and its Application to Consortium Blockchains
Tyler Crain, Vincent Gramoli, Mikel Larrea +1
This paper introduces a deterministic Byzantine consensus algorithm that relies on a new weak coordinator. As opposed to previous algorithms that cannot terminate in the presence o…
cs.DC2010★ 7 cited
Algorithms For Extracting Timeliness Graphs
Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier +1
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p; q) is an e…