1 citations · 1 across the 6 of their papers we have counts for
8 papers · 1 filter
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 …
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 $…