1 citations · 1 across the 5 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DC2022
Different Perspectives on FLP Impossibility
Ivan Klianev
We demonstrate termination of binary consensus under the model and conditions used by Fischer, Lynch, and Patterson (FLP) to prove impossibility of binary agreement - in complete a…
cs.DC2022
Synchronous Consensus During Incomplete Synchrony
Ivan Klianev
We present an algorithm for synchronous deterministic Byzantine consensus, tolerant to links failures and links asynchrony. It cares for a class of networks with specific needs, wh…