8 citations · 21 across the 7 of their papers we have counts for
8 papers
Byzantine-Resilient Counting in Networks
Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
We present two distributed algorithms for the {\em Byzantine counting problem}, which is concerned with estimating the size of a network in the presence of a large number of Byzant…
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…
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…