Dr. Parikshit Saikia


  • Assistant Professor
  • Department of Computer Science and Engineering, National Institute of Technology Silchar
  • Assam 788010 INDIA
    Phone: +91-9864979385
    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 and Communication Networks

  Specific areas of research interest, but not limited to are:-

  • Distributed Computing
  • Distributed Artificial Intelligence
  • Graph Algorithms
  • Approximation
  • Communication Networks

Currently I have 02  vacancies for Ph.D. Positions with Fellowship. Highly motivated, enthusiastic, and creative candidates, who want to make the world a better place through scientific and technical research activities, are welcome for Ph.D. position.


I received both PhD and M.Tech in Computer Science and Engineering from Indian Institute of Technology Guwahati (IITG), India. I received BE in Computer Science and Engineering from Assam Engineering College (AEC), affiliated to Gauhati University. My primary research interest lies in Theoretical Computer Science, specifically in Distributed Computing, Distributed Artificial Intelligence, Graph Algorithms, Distributed Approximation, and Communication Networks. I have research publications to my credit in IEEE, Springer, and Conferences of International repute. I have also received Best Paper Award in CANDAR 2019 held at Nagasaki, Japan. I 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. Currently I am working as an Assistant Professor in the Department of Computer Science and Engineering at National Institute of Technology Silchar.

SUBJECTS TAUGHT at NIT Silchar (including currently teaching)

Sl No Subject Code Subject Name Academic Session Level Specialization Intake  Sections Status
1 CS 5101 Foundation of Computing Science July – Dec 2022 PG CSE 17 A Completed (1)
2 CS 5202 Artificial Intelligence July – Dec 2022 PG 1st  and PhD AI 9 A Completed (1)
3 CS 207 Signal and Data Communication Jan-June 2023 UG 4th CSE 180 A & B Completed (1)
4 CS 213 Algorithm Laboratory Jan-June 2023 UG 4th CSE 90 B Completed (1)
5 CS 101 Introduction to Programming March-July 2023 UG 2nd CE 90 B  Completed (2)
6 CS101 Introduction to Programming August-December 2023 UG1st EE 84 E Ongoing
7 CS222 Data Structure and Algorithm July-Dec 2023 UG 3rd EIE 84 A Ongoing
8 CS111 Programming Laboratory August-Dec 2023 UG1st EE 84 E Ongoing
9 CS223 Data Structure and Algorithm Laboratory July-Dec 2023 UG 3rd EIE 84 A Ongoing


SUBJECTS TAUGHT at Other Institutes (IIIT Pune, BIT Mesra, GIMT Guwahati)

  • 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

  • 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, Hardik Jain, Anshul Mangal, and Aditya Singh “Cuisine Prediction from Ingredients using Hyper Parameter Tuning on Machine Learning Algorithms”,  International Conference of IEEE Silchar Subsection (SILCON) 2023 (accepted).
  • 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

Awards and Recognitions

  • 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.

Administrative Responsibilities at NIT Silchar

  • Associate Warden Boys Hostel 7 (from 4/01/2023 till date)
  • Department Website Coordinator (from 24/11/2022 till date)
  • Department Time Table Coordinator (from 5/01/2023 till date)

Review and Services

  • International Journal of Foundation of Computer Science


  • ACM
  • IEEE