33 citations · 254 across the 68 of their papers we have counts for
5 papers · 1 filter
Reaching Approximate Byzantine Consensus with Multi-hop Communication
Lili Su, Nitin Vaidya
We address the problem of reaching consensus in the presence of Byzantine faults. In particular, we are interested in investigating the impact of messages relay on the network conn…
Asynchronous Convex Consensus in the Presence of Crash Faults
Lewis Tseng, Nitin Vaidya
This paper defines a new consensus problem, convex consensus. Similar to vector consensus [13, 20, 19], the input at each process is a d-dimensional vector of reals (or, equivalent…
Iterative Approximate Consensus in the presence of Byzantine Link Failures
Lewis Tseng, Nitin Vaidya
This paper explores the problem of reaching approximate consensus in synchronous point-to-point networks, where each directed link of the underlying communication graph represents…
Optimal CSMA-based Wireless Communication with Worst-case Delay and Non-uniform Sizes
Hongxing Li, Nitin Vaidya
Carrier Sense Multiple Access (CSMA) protocols have been shown to reach the full capacity region for data communication in wireless networks, with polynomial complexity. However, c…
Differentially Private Distributed Optimization
Zhenqi Huang, Sayan Mitra, Nitin Vaidya
In distributed optimization and iterative consensus literature, a standard problem is for agents to minimize a function over a subset of Euclidean space, where the cost fun…