K. Murali Krishnan

According to our database, K. Murali Krishnan authored at least 20 papers between 2005 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

On chordal and perfect plane near-triangulations.

Sameera Muhamed Salam, J. Nandini Warrier, Daphna Chacko, K. Murali Krishnan, K. S. Sudeep

Discret. Appl. Math., 2022

Eternal vertex cover number of maximal outerplanar graphs.

Jasine Babu, K. Murali Krishnan, Veena Prabhakaran, J. Nandini Warrier

CoRR, 2022

Computing Eternal Vertex Cover Number on Maximal Outerplanar Graphs in Linear Time.

Jasine Babu, Karunakaran Murali Krishnan, Veena Prabhakaran, Nandini J. Warrier

Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

2021

On the computational complexity of Data Flow Analysis over finite bounded meet semilattices.

Gaurav Sood, K. Murali Krishnan

Theor. Comput. Sci., 2021

2020

A local characterization for perfect plane near-triangulations.

Sameera Muhamed Salam, Jasine Babu, K. Murali Krishnan

Theor. Comput. Sci., 2020

eXpOS: A Simple Pedagogical Operating System for Undergraduate Instruction.

K. Murali Krishnan

CoRR, 2020

2019

A Fix-Point Characterization of Herbrand Equivalence of Expressions in Data Flow Frameworks.

Jasine Babu, Karunakaran Murali Krishnan, Vineeth Paleri

Proceedings of the Logic and Its Applications - 8th Indian Conference, 2019

On Chordal and Perfect Plane Triangulations.

Sameera Muhamed Salam, Daphna Chacko, J. Nandini Warrier, K. Murali Krishnan, K. S. Sudeep

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Efficient query retrieval in Neo4jHA using metaheuristic social data allocation scheme.

Anita Brigit Mathew, S. D. Madhu Kumar, K. Murali Krishnan, Sameera Muhamed Salam

Comput. Electr. Eng., 2018

2016

An Optimal Seed Based Compression Algorithm for DNA Sequences.

Pamela Vinitha Eric, Gopakumar Gopalakrishnan, Muralikrishnan Karunakaran

Adv. Bioinformatics, 2016

2013

On the computational complexity of Data Flow Analysis

Gaurav Sood, K. Murali Krishnan

CoRR, 2013

2011

On the Complexity of Edge Packing and Vertex Packing

Sameera Muhamed Salam, K. N. Parvathy, K. S. Sudeep, K. Murali Krishnan

CoRR, 2011

2009

Extending Karger's randomized min-cut Algorithm for a Synchronous Distributed setting

S. Shine, K. Murali Krishnan

CoRR, 2009

2008

Lower Bound for the Communication Complexity of the Russian Cards Problem

Aiswarya Cyriac, K. Murali Krishnan

CoRR, 2008

2007

Computing the Stopping Distance of a Tanner Graph Is NP-Hard.

Karunakaran Murali Krishnan, Priti Shankar

IEEE Trans. Inf. Theory, 2007

A Combinatorial Family of Near Regular LDPC Codes.

K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds.

K. Murali Krishnan, Priti Shankar

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs.

K. Murali Krishnan, L. Sunil Chandran

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

On the Complexity of finding stopping set size in Tanner Graphs.

K. Murali Krishnan, Priti Shankar

Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

2005

On the Complexity of finding Stopping Distance in Tanner Graphs

K. Murali Krishnan, Priti Shankar

CoRR, 2005