87 citations · 111 across the 15 of their papers we have counts for
Showing 2011 · cs.DCShow all
3 papers · 2 filters
cs.DC2011★ 2 cited
Byzantine Broadcast in Point-to-Point Networks using Local Linear Coding
Guanfeng Liang, Nitin Vaidya
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine fault…
cs.DC2011★ 3 cited
Capacity of Byzantine Consensus with Capacity-Limited Point-to-Point Links
Guanfeng Liang, Nitin Vaidya
We consider the problem of maximizing the throughput of Byzantine consensus, when communication links have finite capacity. Byzantine consensus is a classical problem in distribute…
cs.DC2011
Error-Free Multi-Valued Consensus with Byzantine Failures
Guanfeng Liang, Nitin Vaidya
In this paper, we present an efficient deterministic algorithm for consensus in presence of Byzantine failures. Our algorithm achieves consensus on an -bit value with communicat…