1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.CC2015
A Sampling Technique of Proving Lower Bounds for Noisy Computations
Chinmoy Dutta, Jaikumar Radhakrishnan
We present a technique of proving lower bounds for noisy computations. This is achieved by a theorem connecting computations on a kind of randomized decision trees and sampling bas…
cs.DC2015★ 1 cited
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…
cs.DC2014★ 1 cited
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…