K. Murali Krishnan

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

6EEAiswarya Cyriac, K. Murali Krishnan: Lower Bound for the Communication Complexity of the Russian Cards Problem CoRR abs/0805.1974: (2008)
5EEK. Murali Krishnan, Priti Shankar: Computing the Stopping Distance of a Tanner Graph Is NP-Hard. IEEE Transactions on Information Theory 53(6): 2278-2280 (2007)
4EEK. Murali Krishnan, L. Sunil Chandran: Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs. FSTTCS 2006: 69-80
3EEK. Murali Krishnan, Priti Shankar: Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds CoRR abs/cs/0601126: (2006)
2EEK. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar: A Combinatorial Family of Near Regular LDPC Codes CoRR abs/cs/0609146: (2006)
1EEK. Murali Krishnan, Priti Shankar: On the Complexity of finding Stopping Distance in Tanner Graphs CoRR abs/cs/0512101: (2005)

Coauthor Index

1L. Sunil Chandran [2] [4]
2Aiswarya Cyriac [6]
3Priti Shankar [1] [2] [3] [5]
4Rajdeep Singh [2]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)