1 citations · 1 across the 3 of their papers we have counts for
3 papers
Computing Tree Structures in Anonymous Graphs via Mobile Agents
Prabhat Kumar Chand, Manish Kumar, Anisur Rahaman Molla
Minimum Spanning Tree (MST) and Breadth-First Search (BFS) tree constructions are classical problems in distributed computing, traditionally studied in the message-passing model, w…
Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement
Manish Kumar, Anisur Rahaman Molla
This paper studies the message complexity of authenticated Byzantine agreement (BA) in synchronous, fully-connected distributed networks under an honest majority. We focus on the s…
Fault-Tolerant Graph Realizations in the Congested Clique
Anisur Rahaman Molla, Manish Kumar, Sumathi Sivasubramaniam
In this paper, we study the graph realization problem in the Congested Clique model of distributed computing under crash faults. We consider {\em degree-sequence realization}, in w…