K. Murali Krishnan

Orcid: 0000-0002-3587-0511

Affiliations:
  • National Institute of Technology Calicut, Department of Computer Science and Engineering, India
  • Indian Institute of Science, Department of Computer Science and Automation, Bangalore, India (PhD)


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
On chordal and perfect plane near-triangulations.
Discret. Appl. Math., 2022

Eternal vertex cover number of maximal outerplanar graphs.
CoRR, 2022

Computing Eternal Vertex Cover Number on Maximal Outerplanar Graphs in Linear Time.
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.
Theor. Comput. Sci., 2021

2020
A local characterization for perfect plane near-triangulations.
Theor. Comput. Sci., 2020

eXpOS: A Simple Pedagogical Operating System for Undergraduate Instruction.
CoRR, 2020

2019
A Fix-Point Characterization of Herbrand Equivalence of Expressions in Data Flow Frameworks.
Proceedings of the Logic and Its Applications - 8th Indian Conference, 2019

On Chordal and Perfect Plane Triangulations.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018
Efficient query retrieval in Neo4jHA using metaheuristic social data allocation scheme.
Comput. Electr. Eng., 2018

2016
An Optimal Seed Based Compression Algorithm for DNA Sequences.
Adv. Bioinformatics, 2016

2013
On the computational complexity of Data Flow Analysis
CoRR, 2013

2011
On the Complexity of Edge Packing and Vertex Packing
CoRR, 2011

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

2008
Lower Bound for the Communication Complexity of the Russian Cards Problem
CoRR, 2008

2007
Computing the Stopping Distance of a Tanner Graph Is NP-Hard.
IEEE Trans. Inf. Theory, 2007

A Combinatorial Family of Near Regular LDPC Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds.
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.
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.
Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

2005
On the Complexity of finding Stopping Distance in Tanner Graphs
CoRR, 2005


  Loading...