5 citations · 10 across the 6 of their papers we have counts for
3 papers · 1 filter
Fault-Tolerant Graph Realizations in the Congested Clique
Anisur Rahaman Molla, Manish Kumar, Sumathi Sivasubramaniam
In this paper, we study the graph realization problem in the Congested Clique model of distributed computing under crash faults. We consider {\em degree-sequence realization}, in w…
Distributed Computation of Mixing Time
Anisur Rahaman Molla, Gopal Pandurangan
The mixing time of a graph is an important metric, which is not only useful in analyzing connectivity and expansion properties of the network, but also serves as a key parameter in…
Fast Distributed Computation in Dynamic Networks via Random Walks
Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
The paper investigates efficient distributed computation in dynamic networks in which the network topology changes (arbitrarily) from round to round. Our first contribution is a ri…