5 citations · 10 across the 8 of their papers we have counts for
8 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…
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…
Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses
Over the years, much research involving mobile computational entities has been performed. From modeling actual microscopic (and smaller) robots, to modeling software processes on a…
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 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…
Greedy Routing and the Algorithmic Small-World Phenomenom
Karl Bringmann, Ralph Keusch, Johannes Lengler +2
The algorithmic small-world phenomenon, empirically established by Milgram's letter forwarding experiments from the 60s, was theoretically explained by Kleinberg in 2000. However,…