67 citations · 140 across the 37 of their papers we have counts for
5 papers · 1 filter
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…
Information Spreading in Dynamic Networks under Oblivious Adversaries
John Augustine, Chen Avin, Mehraneh Liaee +2
We study the problem of gossip in dynamic networks controlled by an adversary that can modify the network arbitrarily from one round to another, provided that the network is always…
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
This paper presents a randomized Las Vegas distributed algorithm that constructs a minimum spanning tree (MST) in weighted networks with optimal (up to polylogarithmic factors) tim…
Checkpointing to minimize completion time for Inter-dependent Parallel Processes on Volunteer Grids
Mohammad Tanvir Rahman, Hien Nguyen, Jaspal Subhlok +1
Volunteer computing is being used successfully for large scale scientific computations. This research is in the context of Volpex, a programming framework that supports communicati…
On the Distributed Complexity of Large-Scale Graph Computations
Gopal Pandurangan, Peter Robinson, Michele Scquizzato
Motivated by the increasing need to understand the distributed algorithmic foundations of large-scale graph computations, we study some fundamental graph problems in a message-pass…