Foundational Lecture Series on Theoretical Computer Science 2026

The second edition of this series is designed to build foundational skills in theoretical computer science, running from June 15 to 27, 2026. Open to only second-year and higher undergraduate students, as well as master's and doctoral students, participation is through nomination or self-registration.

Seats are limited, so early sign-ups are encouraged. A few out-of-station attendees will be hosted on campus. Candidates from all academic institutions, with necessary background, are welcome to apply. We encourage students of diverse collegiate backgrounds to apply, especially those who have not previously been exposed to these topics in their coursework. Among other factors, early applications will be viewed favourably during the shortlisting process. Registration is now open and will be finalized in the next few weeks.

Registration

Registration will be received in two parts.

By nomination: College/university teachers and instructors can nominate up to three students by sending an email to [email protected] with their names, email addresses and reasons for nomination. Instructors must ensure that nominated students complete the following form: Registration is closed now.
By registration: Interested candidates can express interest by registering themselves by filling out this form: Registration is closed now.

Please note that we have very limited seats available so early registration is highly recommended. Especially those seeking on-campus accommodation.

Venue

The event will take place at IMSc Campus. Click here for directions: Reaching IMSc

Schedule

Click here to see the updated schedule

Date	Slot	Speaker	Topic
WEEK 1
15/06/26	09:15	Opening
	09:45 - 11:00	Venkatesh Raman	Algorithms and Lower bounds for Selection Problems
	11:15 - 12:30	Venkatesh Raman	Algorithms and Lower bounds for Selection Problems
	14:00 - 15:15	Souvik Saha	Maximum Coverage: From Polynomial-Time to FPT Approximation
	15:30 - 16:45	Sanjay Seetharaman	Maximin Share Allocations: An Introduction
16/06/26	09:45 - 11:00	Venkatesh Raman	Algorithms and Lower bounds for Selection Problems
	11:15 - 12:30	Venkatesh Raman	Algorithms and Lower bounds for Selection Problems
	14:00 - 15:15	Arijit Ghosh	VC Theory and PAC Learning
	15:30 - 16:45	Sanjay Seetharaman	Tutorial (Algorithms and Lower bounds for Selection Problems)
17/06/26	09:45 - 11:00	Arijit Ghosh	VC Theory and PAC Learning
	11:15 - 12:30	Vikram Sharma	Combinatorics and Topology
	14:00 - 15:15	Venkat Guruswami	The Power of Subspace Designs: Optimal List Decoding, Proximity gaps, and More
18/06/26	09:45 - 11:00	Shivesh K. Roy	Sunflower Lemma and Its Applications
	11:15 - 12:30	Vikram Sharma	Combinatorics and Topology
	14:00 - 15:15	Mohanapriya A	Budget-feasible Egalitarian Allocation of Conflicting Jobs
	15:30 - 16:45	Abhijith R Nair	The math behind fixed point algorithms
19/06/26	09:45 - 11:00	Lawqueen Kanesh	NP-Completeness and Beyond
	11:15 - 12:30	Govind R	Introduction to Model Checking
	14:00 - 15:15	Debasish Pattanayak	Introduction to Distributed Computing
	15:30 - 16:45	Sravanthi Chede	Introduction to Proof Complexity
20/06/26	09:45 - 11:00	Lawqueen Kanesh	NP-Completeness and Beyond
20/06/26	11:15 - 12:30	Soumi Nandi	Hitting Set and Bounded VC Dimension
WEEK 2
22/06/26	09:45 - 11:00	Ramya C	Introduction to Coding Theory
	11:15 - 12:30	V Arvind	Eigenvalues of Graphs
	14:00 - 15:15	Vaibhav Krishnan	Polynomials and Computation
	15:30 - 16:45	Satya Amar	Diagonalization and Beyond
23/06/26	09:45 - 11:00	Ramya C	Introduction to Coding Theory
	11:15 - 12:30	V Arvind	Eigenvalues of Graphs
	14:00 - 15:15	Ishan Chakraborty	Cactus representation of mincuts
	15:30 - 16:45	Hitesh Wankhede	Tutorial (Eigenvalues of Graphs)
24/06/26	09:45 - 11:00	Prakash Saivasan	Aspects of computing
	11:15 - 12:30	Prakash Saivasan	Aspects of computing
	14:00 - 15:15	Sanjay Seetharaman	Introduction to Linear Programming
	15:30 - 16:45	Sobyasachi Chatterjee	Connected Vertex Cover: A 2^k Algorithm
25/06/26	09:45 - 11:00	Prakash Saivasan	Aspects of computing
	11:15 - 12:30	Prakash Saivasan	Aspects of computing
	14:00 - 15:15	Sanjay Seetharaman	Introduction to Linear Programming
	15:30 - 16:45	Hitesh Wankhede	Combinatorics and Roots of Polynomials
27/06/26	09:45 - 11:00	Gopinath Mishra	Introduction to Randomized Algorithms
	11:15 - 11:45	Singanporia Kushal Piyushkumar	How to Guard A Museum?
	11:45 - 12:15	Roseline Jerry Aloor	Polynomial Identity Testing
	12:15 - 12:30	Closing

Frequently Asked Questions (FAQs)

Is there any charge for accommodation for accommodated students?
No, accommodation is free for accommodated students.
Do accommodated students need to pay for meals?
No, accommodated students will receive breakfast, lunch, and dinner for free.
Will non-accommodated students receive meals?
Non-accommodated students will only get lunch for free. They will not receive breakfast or dinner.
Is lunch free for everyone?
Yes, lunch is free for both accommodated and non-accommodated students.
Will I receive a certificate of attendance?
Yes, a certificate of attendance will be provided upon completion of the program.
What are the requirements to receive the certificate of attendance?
You must maintain a satisfactory attendance record, as specified at the start of the program.
What constitutes a satisfactory attendance record?
The specific attendance criteria will be explained at the start of the program. Ensure you meet the outlined requirements.
When will the certificate be issued?
The certificate will be issued at the end of the program.

Previous Edition

Foundational Lecture Series on Theoretical Computer Science 2025

Links to upcoming and past outreach events (including videos, slides and notes) may be found here. For any other queries, email us: [email protected]