1 citations · 1 across the 4 of their papers we have counts for
6 papers
Run for Cover: Dominating Set via Mobile Agents
Prabhat Kumar Chand, Anisur Rahaman Molla, Sumathi Sivasubramaniam
Research involving computing with mobile agents is a fast-growing field, given the advancement of technology in automated systems, e.g., robots, drones, self-driving cars, etc. The…
Improved Deterministic Leader Election in Diameter-Two Networks
Manish Kumar, Anisur Rahaman Molla, Sumathi Sivasubramaniam
In this paper, we investigate the leader election problem in diameter-two networks. Recently, Chatterjee et al. [DC 2020] studied the leader election in diameter-two networks. They…
Fault-Tolerant Dispersion of Mobile Robots
Prabhat Kumar Chand, Manish Kumar, Anisur Rahaman Molla +1
We consider the mobile robot dispersion problem in the presence of faulty robots (crash-fault). Mobile robot dispersion consists of robots in an -node anonymous graph.…
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…
Distributed Graph Realizations
John Augustine, Keerti Choudhary, Avi Cohen +3
We study graph realization problems from a distributed perspective and we study it in the node capacitated clique (NCC) model of distributed computing, recently introduced for repr…
Spartan: Sparse Robust Addressable Networks
John Augustine, Sumathi Sivasubramaniam
A Peer-to-Peer (P2P) network is a dynamic collection of nodes that connect with each other via virtual overlay links built upon an underlying network (usually, the Internet). P2P n…