4 citations · 10 across the 6 of their papers we have counts for
7 papers
Byzantine Consensus in Directed Hypergraphs
Muhammad Samir Khan, Nitin H. Vaidya
Byzantine consensus is a classical problem in distributed computing. Each node in a synchronous system starts with a binary input. The goal is to reach agreement in the presence of…
Exact Byzantine Consensus on Arbitrary Directed Graphs under Local Broadcast Model
Muhammad Samir Khan, Lewis Tseng, Nitin H. Vaidya
We consider Byzantine consensus in a synchronous system where nodes are connected by a network modeled as a directed graph, i.e., communication links between neighboring nodes are…
Asynchronous Byzantine Consensus on Undirected Graphs under Local Broadcast Model
Muhammad Samir Khan, Nitin Vaidya
In this work we look at Byzantine consensus in asynchronous systems under the local broadcast model. In the local broadcast model, a message sent by any node is received identicall…
Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model
Muhammad Samir Khan, Syed Shalan Naqvi, Nitin H. Vaidya
This paper considers the Byzantine consensus problem for nodes with binary inputs. The nodes are interconnected by a network represented as an undirected graph, and the system is a…
Byzantine Consensus under Local Broadcast Model: Tight Sufficient Condition
Muhammad Samir Khan, Nitin H. Vaidya
In this work we consider Byzantine Consensus on undirected communication graphs under the local broadcast model. In the classical point-to-point communication model the messages ex…
Exact Byzantine Consensus Under Local-Broadcast Model
Syed Shalan Naqvi, Muhammad Samir Khan, Nitin H. Vaidya
This paper considers the problem of achieving exact Byzantine consensus in a synchronous system under a local-broadcast communication model. The nodes communicate with each other v…
Optimal Record and Replay under Causal Consistency
Russell L. Jones, Muhammad S. Khan, Nitin H. Vaidya
We investigate the minimum record needed to replay executions of processes that share causally consistent memory. For a version of causal consistency, we identify optimal records u…