Near-optimal random walk sampling in distributed networks. - Atish Das Sarma; Anisur Rahaman Molla; Gopal Pandurangan (INFOCOM, 2012)

Fast Distributed Computation in Dynamic Networks via Random Walks. - Atish Das Sarma; Anisur Rahaman Molla; Gopal Pandurangan (DISC, 2012)

Storage and search in dynamic peer-to-peer networks. - John Augustine; Anisur Rahaman Molla; Ehab Morsy; Gopal Pandurangan; Peter Robinson 002; Eli Upfal (SPAA, 2013)

Distributed Computation of Sparse Cuts. - Atish Das Sarma; Anisur Rahaman Molla; Gopal Pandurangan (CoRR, 2013)

Distributed Computation of Sparse Cuts via Random Walks. - Atish Das Sarma; Anisur Rahaman Molla; Gopal Pandurangan (ICDCN, 2015)

Distributed Sparse Cut Approximation. - Fabian Kuhn; Anisur Rahaman Molla (OPODIS, 2015)

Efficient random walk sampling in distributed networks. - Atish Das Sarma; Anisur Rahaman Molla; Gopal Pandurangan (J. Parallel Distributed Comput., 2015)

Distributed computation in dynamic networks via random walks. - Atish Das Sarma; Anisur Rahaman Molla; Gopal Pandurangan (Theor. Comput. Sci., 2015)

Fast distributed PageRank computation. - Atish Das Sarma; Anisur Rahaman Molla; Gopal Pandurangan; Eli Upfal (Theor. Comput. Sci., 2015)

Greedy Routing and the Algorithmic Small-World Phenomenom. - Karl Bringmann; Ralph Keusch; Johannes Lengler; Yannic Maus; Anisur Rahaman Molla (CoRR, 2016)

Distributed Computation of Mixing Time. - Anisur Rahaman Molla; Gopal Pandurangan (ICDCN, 2017)

Local Mixing Time: Distributed Computation and Applications. - Anisur Rahaman Molla; Gopal Pandurangan (IPDPS, 2018)

Sublinear Message Bounds for Randomized Agreement. - John Augustine; Anisur Rahaman Molla; Gopal Pandurangan (PODC, 2018)

Improved Dispersion of Mobile Robots on Arbitrary Graphs. - Anisur Rahaman Molla; Gokarna Sharma (CoRR, 2018)

Fast Dispersion of Mobile Robots on Arbitrary Graphs. - Ajay D. Kshemkalyani; Anisur Rahaman Molla; Gokarna Sharma (ALGOSENSORS, 2019)

The Communication Cost of Information Spreading in Dynamic Networks. - Mohamad Ahmadi; Fabian Kuhn; Shay Kutten; Anisur Rahaman Molla; Gopal Pandurangan (ICDCS, 2019)

Efficient Distributed Community Detection in the Stochastic Block Model. - Reza Fathi; Anisur Rahaman Molla; Gopal Pandurangan (ICDCS, 2019)

Dispersion of Mobile Robots: The Power of Randomness. - Anisur Rahaman Molla; William K. Moses Jr. (TAMC, 2019)

Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine Protocols. - John Augustine; Valerie King; Anisur Rahaman Molla; Gopal Pandurangan; Jared Saia (CoRR, 2019)

Optimal deterministic distributed algorithms for maximal independent set in geometric graphs. - Anisur Rahaman Molla; Supantha Pandit; Sasanka Roy (J. Parallel Distributed Comput., 2019)

Live Exploration with Mobile Robots in a Dynamic Ring, Revisited. - Subhrangsu Mandal; Anisur Rahaman Molla; William K. Moses Jr. (ALGOSENSORS, 2020)

Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots. - Anisur Rahaman Molla; Kaushik Mondal 001; William K. Moses Jr. (ALGOSENSORS, 2020)

Dispersion of Mobile Robots in the Global Communication Model. - Ajay D. Kshemkalyani; Anisur Rahaman Molla; Gokarna Sharma (ICDCN, 2020)

Efficient Dispersion of Mobile Robots on Dynamic Graphs. - Ajay D. Kshemkalyani; Anisur Rahaman Molla; Gokarna Sharma (ICDCS, 2020)

Efficient Distributed Algorithms for the K-Nearest Neighbors Problem. - Reza Fathi; Anisur Rahaman Molla; Gopal Pandurangan (SPAA, 2020)

Smoothed Analysis of Leader Election in Distributed Networks. - Anisur Rahaman Molla; Disha Shur (SSS, 2020)

Dispersion of Mobile Robots on Grids. - Ajay D. Kshemkalyani; Anisur Rahaman Molla; Gokarna Sharma (WALCOM, 2020)

Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols. - John Augustine; Valerie King; Anisur Rahaman Molla; Gopal Pandurangan; Jared Saia (DISC, 2020)

Efficient Dispersion on an Anonymous Ring in the Presence of Byzantine Robots. - Anisur Rahaman Molla; Kaushik Mondal 001; William K. Moses Jr. (CoRR, 2020)

Economy Versus Disease Spread: Reopening Mechanisms for COVID 19. - John Augustine; Khalid Hourani; Anisur Rahaman Molla; Gopal Pandurangan; Adi Pasic (CoRR, 2020)

The cost of global broadcast in dynamic radio networks. - Mohamad Ahmadi; Abdolhamid Ghodselahi; Fabian Kuhn; Anisur Rahaman Molla (Theor. Comput. Sci., 2020)

Byzantine Dispersion on Graphs. - Anisur Rahaman Molla; Kaushik Mondal 001; William K. Moses Jr. (IPDPS, 2021)

Weak Amnesiac Flooding. - Zahra Bayramzadeh; Ajay D. Kshemkalyani; Anisur Rahaman Molla; Gokarna Sharma (ISPDC, 2021)

Weak Amnesiac Flooding of Multiple Messages. - Zahra Bayramzadeh; Ajay D. Kshemkalyani; Anisur Rahaman Molla; Gokarna Sharma (NETYS, 2021)

Byzantine Agreement and Leader Election: From Classical to the Modern. - John Augustine; Anisur Rahaman Molla; Gopal Pandurangan (PODC, 2021)

Brief Announcement: On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement. - Manish Kumar; Anisur Rahaman Molla (PODC, 2021)

Min-Max Gathering of Oblivious Robots. - Subhash Bhagat; Anisur Rahaman Molla (SPAA, 2021)

Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots. - Anisur Rahaman Molla; Kaushik Mondal 001; William K. Moses Jr. (Theor. Comput. Sci., 2021)

Fault-Tolerant Graph Realizations in the Congested Clique. - Manish Kumar; Anisur Rahaman Molla; Sumathi Sivasubramaniam (ALGOSENSORS, 2022)

Message Complexity of Multi-Valued Implicit Agreement with Shared Random Bits. - Kaustav Bose; Anisur Rahaman Molla (ICDCN, 2022)

Dispersion of Mobile Robots. - Anisur Rahaman Molla; William K. Moses Jr. (ICDCN, 2022)

Byzantine Connectivity Testing in the Congested Clique. - John Augustine; Anisur Rahaman Molla; Gopal Pandurangan; Yadu Vasudev (DISC, 2022)

Greedy routing and the algorithmic small-world phenomenon. - Karl Bringmann; Ralph Keusch; Johannes Lengler; Yannic Maus; Anisur Rahaman Molla (J. Comput. Syst. Sci., 2022)

Dispersion of mobile robots using global communication. - Ajay D. Kshemkalyani; Anisur Rahaman Molla; Gokarna Sharma (J. Parallel Distributed Comput., 2022)

Run for Cover: Dominating Set via Mobile Agents. - Prabhat Kumar Chand; Anisur Rahaman Molla; Sumathi Sivasubramaniam (ALGOWIN, 2023)

Fault-Tolerant Dispersion of Mobile Robots. - Prabhat Kumar Chand; Manish Kumar; Anisur Rahaman Molla; Sumathi Sivasubramaniam (CALDAM, 2023)

Improved Deterministic Leader Election in Diameter-Two Networks. - Manish Kumar; Anisur Rahaman Molla; Sumathi Sivasubramaniam (CIAC, 2023)

Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots. - Anisur Rahaman Molla; Kaushik Mondal 001; William K. Moses Jr. (IPDPS, 2023)

On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement. - Manish Kumar; Anisur Rahaman Molla (IEEE Trans. Parallel Distributed Syst., 2023)

Efficient live exploration of a dynamic ring with mobile robots. - Subhrangsu Mandal; Anisur Rahaman Molla; William K. Moses Jr. (Theor. Comput. Sci., 2023)

Optimizing Robot Dispersion on Unoriented Grids: With and Without Fault Tolerance. - Rik Banerjee; Manish Kumar; Anisur Rahaman Molla (ALGOWIN, 2024)

Agent-Based Triangle Counting and Its Applications in Anonymous Graphs. - Prabhat Kumar Chand; Apurba Das; Anisur Rahaman Molla (AAMAS, 2024)

Distributed Graph Computations via Mobile Robots. - Prabhat Kumar Chand; Anisur Rahaman Molla (ICDCN, 2024)

Maximal Independent Set via Mobile Agents. - Debasish Pattanayak; Subhash Bhagat; Sruti Gan Chaudhuri; Anisur Rahaman Molla (ICDCN, 2024)

Agent-Driven BFS Tree in Anonymous Graphs with Applications. - Prabhat Kumar Chand; Manish Kumar; Anisur Rahaman Molla (NETYS, 2024)

Brief Announcement: Agent-Based Leader Election, MST, and Beyond. - Ajay D. Kshemkalyani; Manish Kumar; Anisur Rahaman Molla; Gokarna Sharma (DISC, 2024)

Agent-based MST Construction. - Ajay D. Kshemkalyani; Manish Kumar; Anisur Rahaman Molla; Gokarna Sharma (CoRR, 2024)

Optimizing Robot Dispersion on Grids: with and without Fault Tolerance. - Rik Banerjee; Manish Kumar; Anisur Rahaman Molla (CoRR, 2024)

Sublinear message bounds of authenticated implicit Byzantine agreement. - Manish Kumar; Anisur Rahaman Molla (Theor. Comput. Sci., 2024)

Faster Leader Election and Its Applications for Mobile Agents with Parameter Advice. - Ajay D. Kshemkalyani; Manish Kumar; Anisur Rahaman Molla; Gokarna Sharma (ICDCIT, 2025)

Optimal Fault-Tolerant Dispersion on Oriented Grids. - Rik Banerjee; Manish Kumar; Anisur Rahaman Molla (ICDCN, 2025)

Near-Linear Time Leader Election in Multiagent Networks. - Ajay D. Kshemkalyani; Manish Kumar; Anisur Rahaman Molla; Gokarna Sharma (AAMAS, 2025)

Brief Announcement: Distributed Butterfly Analysis using Mobile Agents. - Prabhat Kumar Chand; Apurba Das; Anisur Rahaman Molla (SPAA, 2025)

Dispersion is (Almost) Optimal under (A)synchrony. - Ajay D. Kshemkalyani; Manish Kumar; Anisur Rahaman Molla; Debasish Pattanayak; Gokarna Sharma (SPAA, 2025)

Dispersion is (Almost) Optimal under (A)synchrony. - Ajay D. Kshemkalyani; Manish Kumar; Anisur Rahaman Molla; Gokarna Sharma (CoRR, 2025)

Distributed Butterfly Analysis using Mobile Agents. - Prabhat Kumar Chand; Apurba Das; Anisur Rahaman Molla (CoRR, 2025)

Computing Tree Structures in Anonymous Graphs via Mobile Agents. - Prabhat Kumar Chand; Manish Kumar; Anisur Rahaman Molla (CoRR, 2025)

Optimal Dispersion Under Asynchrony. - Debasish Pattanayak; Ajay D. Kshemkalyani; Manish Kumar; Anisur Rahaman Molla; Gokarna Sharma (CoRR, 2025)

Agentic Distributed Computing. - Ajay D. Kshemkalyani; Manish Kumar; Anisur Rahaman Molla; Gokarna Sharma (CoRR, 2025)