K. Murali Krishnan

Publication Activity (10 Years)

Years Active: 2005-2022
Publications (10 Years): 9

Top Topics

Top Venues

Theor. Comput. Sci.

Comput. Electr. Eng.

Discret. Appl. Math.

Publications

Jasine Babu, K. Murali Krishnan, Veena Prabhakaran, J. Nandini Warrier
Eternal vertex cover number of maximal outerplanar graphs. CoRR (2022)
Sameera Muhamed Salam, J. Nandini Warrier, Daphna Chacko, K. Murali Krishnan, K. S. Sudeep
On chordal and perfect plane near-triangulations. Discret. Appl. Math. 319 (2022)
Gaurav Sood, K. Murali Krishnan
On the computational complexity of Data Flow Analysis over finite bounded meet semilattices. Theor. Comput. Sci. 885 (2021)
K. Murali Krishnan
eXpOS: A Simple Pedagogical Operating System for Undergraduate Instruction. CoRR (2020)
Sameera Muhamed Salam, Jasine Babu, K. Murali Krishnan
A local characterization for perfect plane near-triangulations. Theor. Comput. Sci. 840 (2020)
Sameera Muhamed Salam, Daphna Chacko, J. Nandini Warrier, K. Murali Krishnan, K. S. Sudeep
On Chordal and Perfect Plane Triangulations. CALDAM (2019)
Sameera Muhamed Salam, Jasine Babu, K. Murali Krishnan
A local characterization for perfect plane near-triangulations. CoRR (2019)
Anita Brigit Mathew, S. D. Madhu Kumar, K. Murali Krishnan, Sameera Muhamed Salam
Efficient query retrieval in Neo4jHA using metaheuristic social data allocation scheme. Comput. Electr. Eng. 67 (2018)
Jasine Babu, K. Murali Krishnan, Vineeth Paleri
A fix-point characterization of Herbrand equivalence of expressions in data flow frameworks. CoRR (2017)
Gaurav Sood, K. Murali Krishnan
On the computational complexity of Data Flow Analysis CoRR (2013)
Sameera Muhamed Salam, K. N. Parvathy, K. S. Sudeep, K. Murali Krishnan
On the Complexity of Edge Packing and Vertex Packing CoRR (2011)
S. Shine, K. Murali Krishnan
Extending Karger's randomized min-cut Algorithm for a Synchronous Distributed setting CoRR (2009)
Aiswarya Cyriac, K. Murali Krishnan
Lower Bound for the Communication Complexity of the Russian Cards Problem CoRR (2008)
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar
A Combinatorial Family of Near Regular LDPC Codes. ISIT (2007)
K. Murali Krishnan, Priti Shankar
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds CoRR (2006)
K. Murali Krishnan, Priti Shankar
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds. ISIT (2006)
K. Murali Krishnan, L. Sunil Chandran
Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs. FSTTCS (2006)
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar
A Combinatorial Family of Near Regular LDPC Codes CoRR (2006)
K. Murali Krishnan, Priti Shankar
On the Complexity of finding stopping set size in Tanner Graphs. CISS (2006)
K. Murali Krishnan, Priti Shankar
On the Complexity of finding Stopping Distance in Tanner Graphs CoRR (2005)