Folgen
Karunakaran Murali Krishnan
Karunakaran Murali Krishnan
Department of Computer Science and Engineering, NIT Calicut
Bestätigte E-Mail-Adresse bei nitc.ac.in - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Optimizing VM allocation and data placement for data-intensive applications in cloud using ACO metaheuristic algorithm
TP Shabeera, SDM Kumar, SM Salam, KM Krishnan
Engineering Science and Technology, an International Journal 20 (2), 616-628, 2017
1272017
Computing the stopping distance of a Tanner graph is NP-hard
KM Krishnan, P Shankar
IEEE transactions on information theory 53 (6), 2278-2280, 2007
632007
On the complexity of finding stopping distance in Tanner graphs
KM Krishnan, P Shankar
arXiv preprint cs/0512101, 2005
132005
An optimal seed based compression algorithm for DNA sequences
PV Eric, G Gopalakrishnan, M Karunakaran
Advances in bioinformatics 2016 (1), 3528406, 2016
112016
Hardness of approximation results for the problem of finding the stopping distance in tanner graphs
KM Krishnan, LS Chandran
International Conference on Foundations of Software Technology and …, 2006
102006
On the complexity of finding stopping set size in Tanner graphs
KM Krishnan, P Shankar
2006 40th Annual Conference on Information Sciences and Systems, 157-158, 2006
82006
Approximate linear time ML decoding on tail-biting trellises in two rounds
KM Krishnan, P Shankar
2006 IEEE International Symposium on Information Theory, 2245-2249, 2006
72006
Lower bound for the communication complexity of the Russian cards problem
A Cyriac, KM Krishnan
arXiv preprint arXiv:0805.1974, 2008
62008
A combinatorial family of near regular LDPC codes
KM Krishnan, R Singh, LS Chandran, P Shankar
2007 IEEE International Symposium on Information Theory, 761-765, 2007
52007
Efficient query retrieval in Neo4jHA using metaheuristic social data allocation scheme
AB Mathew, SDM Kumar, KM Krishnan, SM Salam
Computers & Electrical Engineering 67, 425-440, 2018
32018
Metaheuristic-based BFDACO data allocation optimization in Neo4jHA for efficient query retrieval
AB Mathew, KM Krishnan, SM Salam
Arabian Journal for Science and Engineering 44 (4), 2959-2972, 2019
22019
A local characterization for perfect plane near-triangulations
SM Salam, J Babu, KM Krishnan
Theoretical Computer Science 840, 45-58, 2020
12020
On chordal and perfect plane triangulations
SM Salam, D Chacko, NJ Warrier, KM Krishnan, KS Sudeep
Algorithms and Discrete Applied Mathematics: 5th International Conference …, 2019
12019
On chordal and perfect plane near-triangulations
SM Salam, NJ Warrier, D Chacko, KM Krishnan, KS Sudeep
Discrete Applied Mathematics 319, 53-60, 2022
2022
Eternal vertex cover number of maximal outerplanar graphs
J Babu, KM Krishnan, V Prabhakaran, NJ Warrier
arXiv preprint arXiv:2201.06577, 2022
2022
Computing Eternal Vertex Cover Number on Maximal Outerplanar Graphs in Linear Time.
J Babu, KM Krishnan, V Prabhakaran, NJ Warrier
ICTCS, 21-33, 2022
2022
On the computational complexity of Data Flow Analysis over finite bounded meet semilattices
G Sood, KM Krishnan
Theoretical Computer Science 885, 30-40, 2021
2021
eXpOS: A Simple Pedagogical Operating System for Undergraduate Instruction
KM Krishnan
arXiv preprint arXiv:2008.03563, 2020
2020
Clustering the biological networks using shortest path.
NJ Warrier, D Chacko, KM Krishnan
Procedia Computer Science 171, 755-760, 2020
2020
On Chordal and Perfect Plane Triangulations
KM Krishnan, KS Sudeep
Algorithms and Discrete Applied Mathematics: 5th International Conference …, 2019
2019
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20