67 citations · 140 across the 37 of their papers we have counts for
8 papers · 1 filter
Sublinear Bounds for Randomized Leader Election
Shay Kutten, Gopal Pandurangan, David Peleg +2
This paper concerns {\em randomized} leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete -node networks that r…
Fast Distributed PageRank Computation
Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan +1
Over the last decade, PageRank has gained importance in a wide range of applications and domains, ever since it first proved to be effective in determining node importance in large…
Can Quantum Communication Speed Up Distributed Computation?
Michael Elkin, Hartmut Klauck, Danupon Nanongkai +1
The focus of this paper is on {\em quantum distributed} computation, where we investigate whether quantum communication can help in {\em speeding up} distributed network algorithms…
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model
Maleq Khan, V. S. Anil Kumar, Gopal Pandurangan +1
A fundamental problem in wireless networks is the \emph{minimum spanning tree} (MST) problem: given a set of wireless nodes, compute a spanning tree , so that the total cost…
DEX: Self-healing Expanders
Gopal Pandurangan, Peter Robinson, Amitabh Trehan
We present a fully-distributed self-healing algorithm DEX, that maintains a constant degree expander network in a dynamic setting. To the best of our knowledge, our algorithm provi…
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…