| 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 | 133 | 2017 |
| 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 | 65 | 2007 |
| Design and analysis of co-operative acoustic and optical hybrid communication for underwater communication S Gauni, CT Manimegalai, KM Krishnan, V Shreeram, VV Arvind, ... Wireless Personal Communications 117, 561-575, 2021 | 22 | 2021 |
| On the complexity of finding stopping distance in Tanner graphs KM Krishnan, P Shankar arXiv preprint cs/0512101, 2005 | 13 | 2005 |
| An optimal seed based compression algorithm for DNA sequences PV Eric, G Gopalakrishnan, M Karunakaran Advances in bioinformatics 2016 (1), 3528406, 2016 | 11 | 2016 |
| 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 | 10 | 2006 |
| 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 | 8 | 2006 |
| 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 | 7 | 2006 |
| Lower bound for the communication complexity of the Russian cards problem A Cyriac, KM Krishnan arXiv preprint arXiv:0805.1974, 2008 | 6 | 2008 |
| 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 | 5 | 2007 |
| 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 | 4 | 2018 |
| 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 | 2 | 2019 |
| A local characterization for perfect plane near-triangulations SM Salam, J Babu, KM Krishnan Theoretical Computer Science 840, 45-58, 2020 | 1 | 2020 |
| eXpOS: A Simple Pedagogical Operating System for Undergraduate Instruction KM Krishnan arXiv preprint arXiv:2008.03563, 2020 | 1 | 2020 |
| 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 | 1 | 2019 |
| A fix-point characterization of herbrand equivalence of expressions in data flow frameworks J Babu, K Murali Krishnan, V Paleri Logic and Its Applications: 8th Indian Conference, ICLA 2019, Delhi, India …, 2019 | 1 | 2019 |
| On chordal and perfect plane near-triangulations SM Salam, NJ Warrier, D Chacko, KM Krishnan, S KS 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 |
