29, June 2016 - till date: "Assistant Professor" in the Department of Computer Science and Engineering, Birla Institute of Technology Mesra, Ranchi.

18, July 2012 - 28, June 2016: "Teaching Cum Research Fellow" in the Department of Computer Science and Engineering, Birla Institute of Technology Mesra, Ranchi.

15, March 2010 - 28, July 2010: "Lecturer" in the Department of Computer Application, Vinoba Bhave University, Hazaribag.

01, January 2009 - 13, March 2010: "Senior Lecturer" in the Department of Computer Science and Engineering, GLBITM, Greater Noida.

17, January 2008 - 31, December 2008: "Senior Lecture" in the Department of Computer Science and Engineering, IIMT College of Engineering, Greater Noida.

04, July 2005 - 17, January 2008: "Lecturer" in the Department of Computer Science and Engineering, MGM CoET, Noida.

• Design and Analysis of Algorithms
• Algorithm Analysis through Statistical Bounds
• Data Science
• Computational Analysis of Poetry

JOURNAL PUBLICATIONS:

Year 2023:

• Naaz K. and Singh N.K. (2023) A seminatural approach towards restoration, classification, and pattern extraction from heritage Hindi poetry: A probabilistic case study with doha chanda. Digital Scholarship in the Humanities (June 2023), Oxford University Press. Accepted. Online ISSN: 2055-768X, Print ISSN 2055-7671, Indexing: SSCI [IF 1.299]
• Singh N.K., Naaz K. and Chakraborty S (2023) Komala and Kathora: A Novel Approach Towards Classification of Hindi Poetry. ACM Transactions on Asian and Low-Resource Language Information Processing (2023), EISSN: 2375-4702, ISSN 2375-4699. Indexing: SCIE [IF 1.92] (Accepted) https://doi.org/10.1145/3589249
• Naaz K. and Singh N.K. (2023) A learning approach towards metre-based classification of similar Hindi poems using proposed two-level data transformation. Digital Scholarship in the Humanities (2023), Oxford University Press. fqad011, https://doi.org/10.1093/llc/fqad011, Online ISSN: 2055-768X, Print ISSN 2055-7671, Indexing: SSCI [IF 1.299]

Year 2022:

• Naaz K. and Singh N. K. (2022) Design and Development of Computational Tools for Analyzing Elements of Hindi Poetry. IEEE Access (2022), Electronic ISSN: 2169-3536, doi: 10.1109/ACCESS.2022.3204388. Indexing: SCIE [IF 3.476] 
• Prakash A., Singh, N.K., Saha, S.K. (2022). Automated extraction of similar poetry for study of literary texts: An experiment on Hindi poetry, ETRI journal (2022), 1-13. Online ISSN: 2233-7326. http://doi.org/10.4218/etrij.2019-0396. Wiley. Indexing: SCIE [IF 1.347]

Year 2021:

• Singh, N.K., Chakraborty, S., and Roy M, (2021). Analysing the poetic structure of Jana-Gana-Mana in Entirety: A statistical approach. Journal of Applied Mathematics and Computation, Vol. 5, No. 4, pp. 264-272. ISSN online: 2576-0653, ISSN print: 2576-0645.

Year 2019:

• Singh, N.K., Chakraborty, S., and Mallick, D.K., 2019. Complexity verification through design and analysis of computer experiments. International Journal of Computational Complexity and Intelligent Algorithms, Vol. 1, No. 2, pp. 178-195. ISSN online: 2048-4739, ISSN print: 2048-4720.

Year 2015:

• Ranjan, H., Agarwal, S. and Singh, N.K., 2015. Design and Analysis of RA Sort. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 5, No. 1, pp. 59-66, January 2015.

• Kumari, A., Singh, N.K. and Chakraborty, S., 2015. A Statistical Comparative Study of Some Sorting Algorithms. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol. 5, No. 4, pp. 21-29, July 2015.

Year 2014:

• Singh, N.K., Chakraborty, S. and Mallick, D.K., 2014. A statistical peek into average case complexity. Int. J. Experimental Design and Process Optimisation, Vol. 4, No. 2, pp. 116-142. [Indexed in Inspec (IET)].

• Singh, N.K., Chakraborty, S. and Mallick, D.K., 2014. A new look at worst case complexity: A statistical approach. International Journal of Analysis, Vol. 2014, Article ID 840432. [Indexed in ESCI (Thomson Reuters), Mathematical Reviews and Zentralblatt MATH database].

• Singh, N.K. et al., 2014. How many interchanges does the replacement sort make for discrete uniform input? International Journal of Applied Engineering Research, Vol. 9, No. 24, pp. 23515-23525. [Indexed in Scopus].

Year 2012:

• Singh, N. K., Pal, M., and Chakraborty, S. Partition Sort Revisited: Reconfirming the    Robustness in Average Case and Much More! International Journal of Computer Science, ISSN 2230-9616 [Online]; 2231-0088 [Print], Engineering and Applications (IJCSEA) Vo2, No.1, February 2012.  

• Singh, N. K. and Chakraborty, S. Smart Sort: A Fast, Efficient and Robust Sorting Algorithm. International Journal of Advanced Computer and Mathematical Sciences, ISSN 2230-9624, vol. 3, Issue 4, pp. 487-493, October 2012.

• Singh, N. K., Pal, M. and Chakraborty, S. Parameterized Complexity of Partition Sort for Negative Binomial Inputs. Research Journal of Engineering Sciences, ISSN 2278-9472, vol. 1(5), pp. 12-16, November 2012.

CONFERENCE PAPER PUBLICATIONS:

Year 2023:

• Naaz, K., and Singh, N.K., 2023. Design and development of an automated tool for determining the presence and extent of rhyme in free verse. 12^th International Conference on Advances in Computer Science and Application - CSA, Bengaluru, India. March 2023.

Year 2021:

• Upadhyay D.K., Mohapatra, S., Singh, N.K., and Bakhla, A.K., 2021. Stacked SVM model for dysthymia prediction in undergraduates’ students. 8^th International Conference on Signal Processing and Integrated Networks (SPIN), pp 1148-1153, doi: 10.1109/SPIN52536.2021.9566004.

Year 2015:

• Singh, N.K., Mallick, D.K. and Chakraborty, S., 2015. Counts vs. weights: From traditional to untraditional complexity analysis of computer algorithms. Future Communication, Information and Computer Science-Zheng (Ed.): © 2015 Taylor & Francis Group, London, 978-1-138-02653-7. [Indexed in EI Compendex, ISI (CPCI-S, ISTP) and Scopus].

Year 2013:

• Singh, N.K., Chakraborty, S. and Mallick, D.K., 2013. On average case analysis through statistical bounds: Linking theory to practice. Jan Zizka (Eds): CCSIT, SIPP, AISC, PDCTA-2013, pp. 145-149. © CS & IT-CSCP 2013.

Year 2012:

• Singh, N. K. and Chakraborty, S. Partition Sort versus Quick Sort: A Comparative Average Case Analysis with Special Emphasis on Parameterized Complexity. Proceedings of the Second International Conference on Advances in Computing and Information Technology (ACITY) July 13-15, 2012, Chennai, India –Volume 2, pp. 107-113. © Springer-Verlag Heidelberg 2012, (Indexed in Scopus).

• Singh, N. K. and Chakraborty, S. A Statistical Approach to the Relative Performance Analysis of Sorting Algorithms. Proceedings of CCSEIT-12, pp. 57-61, October 26-28, 2012, Coimbatore [Tamil Nadu, India]. © 2012 ACM 978-1-4503-1310-0/12/10, (Indexed in Scopus).

Year 2011:

• Singh, N. K. and Chakraborty, S. Partition Sort and its Empirical Analysis. Proceedings of International Conference on Computational Intelligence and Information Technology. CIIT-2011, CCIS 250, pp. 340-346, 2011. © Springer-Verlag Heidelberg 2011 (Indexed in Scopus).