11 citations · 27 across the 9 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
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…