8 citations · 8 across the 2 of their papers we have counts for
3 papers
cs.LO2008★ 8 cited
Lower Bound for the Communication Complexity of the Russian Cards Problem
Aiswarya Cyriac, K. Murali Krishnan
In this paper it is shown that no public announcement scheme that can be modeled in Dynamic Epistemic Logic (DEL) can solve the Russian Cards Problem (RCP) in one announcement. Sin…
cs.IT2006
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds
K. Murali Krishnan, Priti Shankar
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is prsented, that requires exactly two rounds on the trellis. This is an adaptation of an a…
cs.IT2005
On the Complexity of finding Stopping Distance in Tanner Graphs
K. Murali Krishnan, Priti Shankar
Two decision problems related to the computation of stopping sets in Tanner graphs are shown to be NP-complete. NP-hardness of the problem of computing the stopping distance of a T…