6 citations · 6 across the 2 of their papers we have counts for
3 papers
cs.IT2011★ 6 cited
Optimal coding for the deletion channel with small deletion probability
Yashodhan Kanoria, Andrea Montanari
The deletion channel is the simplest point-to-point communication channel that models lack of synchronization. Input bits are deleted independently with probability d, and when the…
cs.MA2011
Subexponential convergence for information aggregation on regular trees
Yashodhan Kanoria, Andrea Montanari
We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k>=2, we assume…
cs.SI2011
Efficient Bayesian Social Learning on Trees
Yashodhan Kanoria, Omer Tamuz
We consider a set of agents who are attempting to iteratively learn the 'state of the world' from their neighbors in a social network. Each agent initially receives a noisy observa…