1 citations · 1 across the 6 of their papers we have counts for
4 papers · 2 filters
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…