1 citations · 1 across the 3 of their papers we have counts for
5 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 …
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…
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…
Computing Functions by Teams of Deterministic Finite Automata
Debasish Pattanayak, Andrzej Pelc
We consider the task of computing functions , where is the set of natural numbers, by finite teams of agents modelled as deterministic…
Deterministic Treasure Hunt and Rendezvous in Arbitrary Connected Graphs
Debasish Pattanayak, Andrzej Pelc
Treasure hunt and rendezvous are fundamental tasks performed by mobile agents in graphs. In treasure hunt, an agent has to find an inert target (called treasure) situated at an unk…