Dr. Parikshit Saikia


  • Assistant Professor
  • Department of Computer Science and Engineering, National Institute of Technology Silchar
  • Assam 788010 INDIA
    Phone: +91-xxxxxxxxxx
    Emails: parikshit[at]cse.nits.ac.in | parikshit.saikia26[at]gmail.com
    Date of Joining: 11/07/2022
    Academic/Industrial Experience: 4+ years
    Google Scholar: Click Here, DBLP Link: Click Here


  • Ph.D. from IIT Guwahati
  • M.Tech.  from IIT Guwahati
  • B.E. from Assam Engineering College


RESEARCH INTERESTS: Theoretical Computer Science

  Specific areas of research interest are:–

  • Graph Algorithms
  • Distributed Computing
  • Approximation



Parikshit Saikia received both PhD and M.Tech in Computer Science and Engineering from Indian Institute of Technology Guwahati (IITG), India. He received BE in Computer Science and Engineering from Assam Engineering College (AEC), affiliated to Gauhati University. His primary research interest lies in Theoretical Computer Science, specifically in Graph Algorithms and Distributed Approximation. He has many research publications to his credit in IEEE, Springer, and Conferences of International repute. He has also received Best Paper Award in CANDAR 2019 held at Nagasaki, Japan. He worked as an Assistant Professor at Indian Institute of Information Technology Pune, Birla Institute of Technology Mesra Ranchi, National Institute of Technology Hamirpur, and Girijananda Chowdhury Institute of Management and Technology Guwahati. He is currently working as an Assistant Professor in the Department of Computer Science and Engineering at National Institute of Technology Silchar.



  • Design and Analysis of Algorithms
  • Data Structures
  • Theory of Computation
  • Combinatorial Optimization
  • Introduction to Computing
  • Computer Networks
  • Operating System
  • Formal Language and Automata Theory
  • Computer Architecture and Organization
  • Artificial Intelligence

  • Parikshit Saikia and Sushanta Karmakar. “Improved distributed approximation for Steiner tree in the CONGEST model”, Journal of Parallel and Distributed Computing (JPDC), Vol. 158, Iss. December, pp. 196–212, 2021. (IF=4.54) [SCI]
  • Parikshit Saikia, Sushanta Karmakar, and Aris Pagourtzis. “Primal-dual based distributed approximation algorithm for prize-collecting Steiner tree”, Discrete Mathematics, Algorithms and Applications (DMAA) pages 2150008-(1–48), Vol. 13, No. 2, 2021. [ESCI, Scopus]
  • Parikshit Saikia} and Sushanta Karmakar. “Distributed approximation algorithms for Steiner tree in the CONGESTED CLIQUE”, International Journal of Foundations of Computer Science (IJFCS), Vol. 31, Iss. 7, pp. 941–968, 2020 [SCIE]

  • Parikshit Saikia and Sushanta Karmakar, “Round-Message Trade-off in Distributed Steiner Tree Construction in the CONGEST model”, In Proceedings of the 16th International Conference on Distributed Computing and Internet Technology (ICDCIT), January 2020, Bhubaneswar, India, pages 111–126
  • Parikshit Saikia and Sushanta Karmakar, “$2(1 – 1/\ell)$-factor Steiner tree approximation in $\tilde{O}(n^{1/3})$ rounds in the CONGESTED CLIQUE”, The Seventh International Symposium on Computing and Networking (CANDAR), November 2019, Nagasaki, Japan, pages 82–91 [Best Paper Award]
  • Parikshit Saikia and Sushanta Karmakar, “A Simple $2(1-1/\ell)$-factor Distributed Approximation Algorithm for Steiner Tree in the CONGEST model”,  In Proceedings of the 20th International Conference on Distributed Computing and Networking (ICDCN), January 2019, Bangalore, India, pages 41–50



  • Best Paper Award in International Symposium on Computing and Networking (CANDAR) held on November 26-29, 2019, at Nagasaki Japan.
  • Merit Award Certificate 2008 from Assam Engineering College.
  • Chief Minister’s Scholarship 2013 from Government of Assam.



  • International Journal of Foundation of Computer Science



  • ACM