activity
20182022
most citedDispersion of Mobile Robots: The Power of Randomness

28 citations · 28 across the 2 of their papers we have counts for

collaborators

13 papers

cs.DC2022

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.…

cs.DC2021

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…

physics.soc-ph2020

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…

cs.DC2020

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…

cs.DC2020

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…

cs.DC2020

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…