67 citations · 140 across the 37 of their papers we have counts for
5 papers · 1 filter
Efficient Computation of Distance Sketches in Distributed Networks
Atish Das Sarma, Michael Dinitz, Gopal Pandurangan
Distance computation is one of the most fundamental primitives used in communication networks. The cost of effectively and accurately computing pairwise network distances can becom…
Information Spreading in Dynamic Networks
Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman +1
We study the fundamental problem of information spreading (also known as gossip) in dynamic networks. In gossip, or more generally, -gossip, there are pieces of information…
Distributed Agreement in Dynamic Peer-to-Peer Networks
John Augustine, Gopal Pandurangan, Peter Robinson +1
Motivated by the need for robust and fast distributed computation in highly dynamic Peer-to-Peer (P2P) networks, we study algorithms for the fundamental distributed agreement probl…
Xheal: Localized Self-healing using Expanders
Gopal Pandurangan, Amitabh Trehan
We consider the problem of self-healing in reconfigurable networks (e.g. peer-to-peer and wireless mesh networks) that are under repeated attack by an omniscient adversary and prop…
A Tight Lower Bound on Distributed Random Walk Computation
Danupon Nanongkai, Atish Das Sarma, Gopal Pandurangan
We consider the problem of performing a random walk in a distributed network. Given bandwidth constraints, the goal of the problem is to minimize the number of rounds required to o…