87 citations · 111 across the 15 of their papers we have counts for
4 papers · 1 filter
Multiparty Equality Function Computation in Networks with Point-to-Point Links
Guanfeng Liang, Nitin Vaidya
In this report, we study the multiparty communication complexity problem of the multiparty equality function (MEQ): EQ(x_1,...,x_n) = 1 if x_1=...=x_n, and 0 otherwise. The input v…
Deterministic Consensus Algorithm with Linear Per-Bit Complexity
Guanfeng Liang, Nitin Vaidya
In this report, building on the deterministic multi-valued one-to-many Byzantine agreement (broadcast) algorithm in our recent technical report [2], we introduce a deterministic mu…
Short Note on Complexity of Multi-Value Byzantine Agreement
Guanfeng Liang, Nitin Vaidya
Randomized algorithm that achieves multi-valued Byzantine agreement with high probability, and achieves optimal complexity.
Complexity of Multi-Value Byzantine Agreement
Guanfeng Liang, Nitin Vaidya
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, given that the sum capacity of all links in between nodes in the system is finite. We ha…