11 citations · 27 across the 9 of their papers we have counts for
3 papers · 1 filter
How Hard is Computing Parity with Noisy Communications?
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath +1
We show a tight lower bound of on the number of transmissions required to compute the parity of input bits with constant error in a noisy communication networ…
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…
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…