67 citations · 118 across the 26 of their papers we have counts for
38 papers
Beyond the Boundary: Optimal Grid Dispersion by Spread, Reverse, and Collect
Manish Kumar, Anisur Rahaman Molla, Debasish Pattanayak +1
\emph{Dispersion} requires a set of mobile agents to occupy distinct nodes of a graph such that each node contains at most one agent. We study deterministic dispersion of …
Semi-Synchronous Exploration in Dynamic Graphs
Ashish Saxena, Anisur Rahaman Molla, Kaushik Mondal +1
We study the fundamental problem of graph exploration in dynamic graphs using mobile agents. We consider -interval connected dynamic graphs, where the topology may change arbitr…
Toward Optimality: A Tighter Analysis of Message Complexity for Leader Election in Diameter-Two Networks
Abhijit Sadhukhan, Adri Bhattacharya, Anisur Rahaman Molla
We study the message complexity of leader election in synchronous networks of diameter two. Our main contribution is a refined analysis of the randomized algorithm proposed by Chat…
Improved Linear-Time Construction of Minimal Dominating Set via Mobile Agents
Prabhat Kumar Chand, Anisur Rahaman Molla
Mobile agents have emerged as a powerful framework for solving fundamental graph problems in distributed settings in recent times. These agents, modelled as autonomous physical or…
Agentic Distributed Computing
Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla +1
The most celebrated and extensively studied model of distributed computing is the {\em message-passing model,} in which each vertex/node of the (distributed network) graph correspo…
Optimal Dispersion Under Asynchrony
Debasish Pattanayak, Ajay D. Kshemkalyani, Manish Kumar +2
We study the dispersion problem in anonymous port-labeled graphs: mobile agents, each with a unique ID and initially located arbitrarily on the nodes of an -node grap…
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…
Dispersion is (Almost) Optimal under (A)synchrony
Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla +1
The dispersion problem has received much attention recently in the distributed computing literature. In this problem, agents placed initially arbitrarily on the nodes of…
Optimal Fault-Tolerant Dispersion on Oriented Grids
Rik Banerjee, Manish Kumar, Anisur Rahaman Molla
Dispersion of mobile robots over the nodes of an anonymous graph is an important problem and turns out to be a crucial subroutine for designing efficient algorithms for many fundam…
Optimizing Robot Dispersion on Grids: with and without Fault Tolerance
Rik Banerjee, Manish Kumar, Anisur Rahaman Molla
The introduction and study of dispersing mobile robots across the nodes of an anonymous graph have recently gained traction and have been explored within various graph classes and…
Agent-based Leader Election, MST, and Beyond
Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla +1
Leader election is one of the fundamental and well-studied problems in distributed computing. In this paper, we initiate the study of leader election using mobile agents. Suppose $…
Agent-Based Triangle Counting: Unlocking Truss Decomposition, Triangle Centrality, and Local Clustering Coefficient
Prabhat Kumar Chand, Apurba Das, Anisur Rahaman Molla
In this paper, we study the problem of \emph{triangle counting} in an arbitrary anonymous graph with nodes and edges using the \emph{mobile-agent model}. Our triangle-c…
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 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…
Byzantine Dispersion on Graphs
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses
This paper considers the problem of Byzantine dispersion and extends previous work along several parameters. The problem of Byzantine dispersion asks: given robots, up to o…
Economy Versus Disease Spread: Reopening Mechanisms for COVID 19
John Augustine, Khalid Hourani, Anisur Rahaman Molla +2
We study mechanisms for reopening economic activities that explore the trade off between containing the spread of COVID-19 and maximizing economic impact. This is of current import…
Efficient Distributed Algorithms for the -Nearest Neighbors Problem
Reza Fathi, Anisur Rahaman Molla, Gopal Pandurangan
The -nearest neighbors is a basic problem in machine learning with numerous applications. In this problem, given a (training) set of data points with labels and a query poin…
Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses
The problem of dispersion of mobile robots on a graph asks that robots initially placed arbitrarily on the nodes of an -node anonymous graph, autonomously move to reach a fi…
Live Exploration with Mobile Robots in a Dynamic Ring, Revisited
Subhrangsu Mandal, Anisur Rahaman Molla, William K. Moses
The graph exploration problem requires a group of mobile robots, initially placed arbitrarily on the nodes of a graph, to work collaboratively to explore the graph such that each n…
Dispersion of Mobile Robots in the Global Communication Model
Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma
The dispersion problem on graphs asks robots placed initially arbitrarily on the nodes of an -node anonymous graph to reposition autonomously to reach a configuration…