8 citations · 21 across the 5 of their papers we have counts for
5 papers · 1 filter
Global Information Sharing under Network Dynamics
Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman +2
We study how to spread tokens of information to every node on an -node dynamic network, the edges of which are changing at each round. This basic {\em gossip problem} can be…
Distributed Symmetry Breaking in Hypergraphs
Shay Kutten, Danupon Nanongkai, Gopal Pandurangan +1
Fundamental local symmetry breaking problems such as Maximal Independent Set (MIS) and coloring have been recognized as important by the community, and studied extensively in (stan…
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…
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…
Discovery through Gossip
Bernhard Haeupler, Gopal Pandurangan, David Peleg +2
We study randomized gossip-based processes in dynamic networks that are motivated by discovery processes in large-scale distributed networks like peer-to-peer or social networks. A…