| 2026 | ICDCIT | Improved Linear-Time Construction of Minimal Dominating Set via Mobile Agents. | Prabhat Kumar Chand, Anisur Rahaman Molla |
| 2026 | SPAA | Brief Announcement: Asynchronous Dispersion with Optimal Time Complexity. | Debasish Pattanayak, Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma |
| 2025 | ICDCIT | Faster Leader Election and Its Applications for Mobile Agents with Parameter Advice. | Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma |
| 2025 | ICDCN | Optimal Fault-Tolerant Dispersion on Oriented Grids. | Rik Banerjee, Manish Kumar, Anisur Rahaman Molla |
| 2025 | SPAA | Brief Announcement: Distributed Butterfly Analysis using Mobile Agents. | Prabhat Kumar Chand, Apurba Das, Anisur Rahaman Molla |
| 2025 | SPAA | Dispersion is (Almost) Optimal under (A)synchrony. | Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Debasish Pattanayak, Gokarna Sharma |
| 2025 | SSS | Computing Tree Structures in Anonymous Graphs via Mobile Agents. | Prabhat Kumar Chand, Manish Kumar, Anisur Rahaman Molla |
| 2024 | Algosensors | Optimizing Robot Dispersion on Unoriented Grids: With and Without Fault Tolerance. | Rik Banerjee, Manish Kumar, Anisur Rahaman Molla |
| 2024 | ICDCN | Distributed Graph Computations via Mobile Robots. | Prabhat Kumar Chand, Anisur Rahaman Molla |
| 2024 | ICDCN | Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement. | Manish Kumar, Anisur Rahaman Molla |
| 2024 | ICDCN | Maximal Independent Set via Mobile Agents. | Debasish Pattanayak, Subhash Bhagat, Sruti Gan Chaudhuri, Anisur Rahaman Molla |
| 2023 | Algosensors | Run for Cover: Dominating Set via Mobile Agents. | Prabhat Kumar Chand, Anisur Rahaman Molla, Sumathi Sivasubramaniam |
| 2023 | CIAC | Improved Deterministic Leader Election in Diameter-Two Networks. | Manish Kumar, Anisur Rahaman Molla, Sumathi Sivasubramaniam |
| 2023 | ICDCN | On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement. | Manish Kumar, Anisur Rahaman Molla |
| 2022 | Algosensors | Fault-Tolerant Graph Realizations in the Congested Clique. | Manish Kumar, Anisur Rahaman Molla, Sumathi Sivasubramaniam |
| 2022 | ICDCN | Message Complexity of Multi-Valued Implicit Agreement with Shared Random Bits. | Kaustav Bose, Anisur Rahaman Molla |
| 2022 | ICDCN | Dispersion of Mobile Robots. | Anisur Rahaman Molla, William K. Moses Jr. |
| 2021 | ISPDC | Weak Amnesiac Flooding. | Zahra Bayramzadeh, Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma |
| 2021 | PODC | Byzantine Agreement and Leader Election: From Classical to the Modern. | John Augustine, Anisur Rahaman Molla, Gopal Pandurangan |
| 2021 | PODC | Brief Announcement: On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement. | Manish Kumar, Anisur Rahaman Molla |
| 2021 | SPAA | Min-Max Gathering of Oblivious Robots. | Subhash Bhagat, Anisur Rahaman Molla |
| 2020 | Algosensors | Live Exploration with Mobile Robots in a Dynamic Ring, Revisited. | Subhrangsu Mandal, Anisur Rahaman Molla, William K. Moses Jr. |
| 2020 | Algosensors | Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots. | Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr. |
| 2020 | ICDCN | Dispersion of Mobile Robots in the Global Communication Model. | Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma |
| 2020 | ICDCS | Efficient Dispersion of Mobile Robots on Dynamic Graphs. | Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma |
| 2020 | SPAA | Efficient Distributed Algorithms for the K-Nearest Neighbors Problem. | Reza Fathi, Anisur Rahaman Molla, Gopal Pandurangan |
| 2020 | SSS | Smoothed Analysis of Leader Election in Distributed Networks. | Anisur Rahaman Molla, Disha Shur |
| 2020 | WALCOM | Dispersion of Mobile Robots on Grids. | Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma |
| 2019 | Algosensors | Fast Dispersion of Mobile Robots on Arbitrary Graphs. | Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma |
| 2019 | ICDCS | The Communication Cost of Information Spreading in Dynamic Networks. | Mohamad Ahmadi, Fabian Kuhn, Shay Kutten, Anisur Rahaman Molla, Gopal Pandurangan |
| 2019 | ICDCS | Efficient Distributed Community Detection in the Stochastic Block Model. | Reza Fathi, Anisur Rahaman Molla, Gopal Pandurangan |
| 2019 | TAMC | Dispersion of Mobile Robots: The Power of Randomness. | Anisur Rahaman Molla, William K. Moses Jr. |
| 2018 | PODC | Sublinear Message Bounds for Randomized Agreement. | John Augustine, Anisur Rahaman Molla, Gopal Pandurangan |
| 2017 | ICDCN | Distributed Computation of Mixing Time. | Anisur Rahaman Molla, Gopal Pandurangan |
| 2017 | PODC | Greedy Routing and the Algorithmic Small-World Phenomenon. | Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla |
| 2015 | ICDCN | Distributed Computation of Sparse Cuts via Random Walks. | Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan |
| 2015 | OPODIS | The Cost of Global Broadcast in Dynamic Radio Networks. | Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, Anisur Rahaman Molla |
| 2015 | OPODIS | Distributed Sparse Cut Approximation. | Fabian Kuhn, Anisur Rahaman Molla |
| 2013 | ICDCN | Fast Distributed PageRank Computation. | Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal |
| 2013 | SPAA | Storage and search in dynamic peer-to-peer networks. | John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal |
| 2012 | INFOCOM | Near-optimal random walk sampling in distributed networks. | Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan |