Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDK. Murali Krishnan 0001
Person information
- affiliation: National Institute of Technology Calicut, Department of Computer Science and Engineering, India
- affiliation (PhD): Indian Institute of Science, Department of Computer Science and Automation, Bangalore, India
Other persons with the same name
- K. Murali Krishnan 0002 — SRM Institute of Science and Technology, Faculty of Engineering and Technology, Kattankulathur, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j6]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: 53-60 (2022)- 2021
- [j5]Gaurav Sood, K. Murali Krishnan:
On the computational complexity of Data Flow Analysis over finite bounded meet semilattices. Theor. Comput. Sci. 885: 30-40 (2021) - 2020
- [j4]Sameera Muhamed Salam, Jasine Babu, K. Murali Krishnan:
A local characterization for perfect plane near-triangulations. Theor. Comput. Sci. 840: 45-58 (2020) - 2018
- [j3]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: 425-440 (2018) - 2016
- [j2]Pamela Vinitha Eric, Gopakumar Gopalakrishnan, Muralikrishnan Karunakaran:
An Optimal Seed Based Compression Algorithm for DNA Sequences. Adv. Bioinformatics 2016: 3528406:1-3528406:7 (2016) - 2007
- [j1]Karunakaran Murali Krishnan, Priti Shankar:
Computing the Stopping Distance of a Tanner Graph Is NP-Hard. IEEE Trans. Inf. Theory 53(6): 2278-2280 (2007)
Conference and Workshop Papers
- 2022
- [c7]Jasine Babu, Karunakaran Murali Krishnan, Veena Prabhakaran, Nandini J. Warrier:
Computing Eternal Vertex Cover Number on Maximal Outerplanar Graphs in Linear Time. ICTCS 2022: 21-33 - 2019
- [c6]Sameera Muhamed Salam, Daphna Chacko, J. Nandini Warrier, K. Murali Krishnan, K. S. Sudeep:
On Chordal and Perfect Plane Triangulations. CALDAM 2019: 274-285 - [c5]Jasine Babu, Karunakaran Murali Krishnan, Vineeth Paleri:
A Fix-Point Characterization of Herbrand Equivalence of Expressions in Data Flow Frameworks. ICLA 2019: 160-172 - 2007
- [c4]K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar:
A Combinatorial Family of Near Regular LDPC Codes. ISIT 2007: 761-765 - 2006
- [c3]K. Murali Krishnan, Priti Shankar:
On the Complexity of finding stopping set size in Tanner Graphs. CISS 2006: 157-158 - [c2]K. Murali Krishnan, L. Sunil Chandran:
Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs. FSTTCS 2006: 69-80 - [c1]K. Murali Krishnan, Priti Shankar:
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds. ISIT 2006: 2245-2249
Informal and Other Publications
- 2022
- [i11]Jasine Babu, K. Murali Krishnan, Veena Prabhakaran, J. Nandini Warrier:
Eternal vertex cover number of maximal outerplanar graphs. CoRR abs/2201.06577 (2022) - 2020
- [i10]K. Murali Krishnan:
eXpOS: A Simple Pedagogical Operating System for Undergraduate Instruction. CoRR abs/2008.03563 (2020) - 2019
- [i9]Sameera Muhamed Salam, Jasine Babu, K. Murali Krishnan:
A local characterization for perfect plane near-triangulations. CoRR abs/1906.06200 (2019) - 2017
- [i8]Jasine Babu, K. Murali Krishnan, Vineeth Paleri:
A fix-point characterization of Herbrand equivalence of expressions in data flow frameworks. CoRR abs/1708.04976 (2017) - 2013
- [i7]Gaurav Sood, K. Murali Krishnan:
On the computational complexity of Data Flow Analysis. CoRR abs/1303.4315 (2013) - 2011
- [i6]Sameera Muhamed Salam, K. N. Parvathy, K. S. Sudeep, K. Murali Krishnan:
On the Complexity of Edge Packing and Vertex Packing. CoRR abs/1103.5560 (2011) - 2009
- [i5]S. Shine, K. Murali Krishnan:
Extending Karger's randomized min-cut Algorithm for a Synchronous Distributed setting. CoRR abs/0912.1200 (2009) - 2008
- [i4]Aiswarya Cyriac, K. Murali Krishnan:
Lower Bound for the Communication Complexity of the Russian Cards Problem. CoRR abs/0805.1974 (2008) - 2006
- [i3]K. Murali Krishnan, Priti Shankar:
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds. CoRR abs/cs/0601126 (2006) - [i2]K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar:
A Combinatorial Family of Near Regular LDPC Codes. CoRR abs/cs/0609146 (2006) - 2005
- [i1]K. Murali Krishnan, Priti Shankar:
On the Complexity of finding Stopping Distance in Tanner Graphs. CoRR abs/cs/0512101 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-09 05:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
