On the Complexity of finding Stopping Distance in Tanner Graphs - K. Murali Krishnan 001; Priti Shankar (CoRR, 2005)

On the Complexity of finding stopping set size in Tanner Graphs. - K. Murali Krishnan 001; Priti Shankar (CISS, 2006)

Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs. - K. Murali Krishnan 001; L. Sunil Chandran (FSTTCS, 2006)

Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds. - K. Murali Krishnan 001; Priti Shankar (ISIT, 2006)

A Combinatorial Family of Near Regular LDPC Codes. - K. Murali Krishnan 001; Rajdeep Singh; L. Sunil Chandran; Priti Shankar (ISIT, 2007)

Computing the Stopping Distance of a Tanner Graph Is NP-Hard. - Karunakaran Murali Krishnan; Priti Shankar (IEEE Trans. Inf. Theory, 2007)

Lower Bound for the Communication Complexity of the Russian Cards Problem - Aiswarya Cyriac; K. Murali Krishnan 001 (CoRR, 2008)

Extending Karger's randomized min-cut Algorithm for a Synchronous Distributed setting - S. Shine; K. Murali Krishnan 001 (CoRR, 2009)

On the Complexity of Edge Packing and Vertex Packing - Sameera Muhamed Salam; K. N. Parvathy; K. S. Sudeep; K. Murali Krishnan 001 (CoRR, 2011)

On the computational complexity of Data Flow Analysis - Gaurav Sood 001; K. Murali Krishnan 001 (CoRR, 2013)

An Optimal Seed Based Compression Algorithm for DNA Sequences. - Pamela Vinitha Eric; Gopakumar Gopalakrishnan 001; Muralikrishnan Karunakaran (Adv. Bioinformatics, 2016)

Efficient query retrieval in Neo4jHA using metaheuristic social data allocation scheme. - Anita Brigit Mathew; S. D. Madhu Kumar; K. Murali Krishnan 001; Sameera Muhamed Salam (Comput. Electr. Eng., 2018)

On Chordal and Perfect Plane Triangulations. - Sameera Muhamed Salam; Daphna Chacko; J. Nandini Warrier; K. Murali Krishnan 001; K. S. Sudeep (CALDAM, 2019)

A Fix-Point Characterization of Herbrand Equivalence of Expressions in Data Flow Frameworks. - Jasine Babu; Karunakaran Murali Krishnan; Vineeth Paleri (ICLA, 2019)

eXpOS: A Simple Pedagogical Operating System for Undergraduate Instruction. - K. Murali Krishnan 001 (CoRR, 2020)

A local characterization for perfect plane near-triangulations. - Sameera Muhamed Salam; Jasine Babu; K. Murali Krishnan 001 (Theor. Comput. Sci., 2020)

On the computational complexity of Data Flow Analysis over finite bounded meet semilattices. - Gaurav Sood 001; K. Murali Krishnan 001 (Theor. Comput. Sci., 2021)

Eternal vertex cover number of maximal outerplanar graphs. - Jasine Babu; K. Murali Krishnan 001; Veena Prabhakaran; J. Nandini Warrier (CoRR, 2022)

On chordal and perfect plane near-triangulations. - Sameera Muhamed Salam; J. Nandini Warrier; Daphna Chacko; K. Murali Krishnan 001; K. S. Sudeep (Discret. Appl. Math., 2022)

Computing eternal vertex cover number of maximal outerplanar graphs in linear time. - Jasine Babu; K. Murali Krishnan 001; Veena Prabhakaran; Nandini J. Warrier (Theor. Comput. Sci., 2025)