activity
20092022
most citedByzantine Multi-Agent Optimization: Part II

33 citations · 254 across the 68 of their papers we have counts for

collaborators
Showing 2011Show all

5 papers · 1 filter

eess.SY2011★ 10 cited

Distributed Algorithms for Consensus and Coordination in the Presence of Packet-Dropping Communication Links - Part II: Coefficients of Ergodicity Analysis Approach

Nitin H. Vaidya, Christoforos N. Hadjicostis, Alejandro D. Dominguez-Garcia

In this two-part paper, we consider multicomponent systems in which each component can iteratively exchange information with other components in its neighborhood in order to comput…

eess.SY2011★ 4 cited

Distributed Algorithms for Consensus and Coordination in the Presence of Packet-Dropping Communication Links - Part I: Statistical Moments Analysis Approach

Alejandro D. Dominguez-Garcia, Christoforos N. Hadjicostis, Nitin H. Vaidya

This two-part paper discusses robustification methodologies for linear-iterative distributed algorithms for consensus and coordination problems in multicomponent systems, in which…

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…