IMSc Outreach

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 is closed now.

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

WEEK 1

#
DateSlotSpeakerTopic
15/06/2609:15OpeningOpening
15/06/2609:45 - 11:00Venkatesh RamanAlgorithms and Lower bounds for Selection Problems
15/06/2611:15 - 12:30Venkatesh RamanAlgorithms and Lower bounds for Selection Problems
15/06/2614:00 - 15:15Souvik SahaMaximum Coverage: From Polynomial-Time to FPT Approximation
15/06/2615:30 - 16:45Sanjay SeetharamanMaximin Share Allocations: An Introduction
16/06/2609:45 - 11:00Venkatesh RamanAlgorithms and Lower bounds for Selection Problems
16/06/2611:15 - 12:30Venkatesh RamanAlgorithms and Lower bounds for Selection Problems
16/06/2614:00 - 15:15Arijit GhoshVC Theory and PAC Learning
16/06/2615:30 - 16:45Sanjay SeetharamanTutorial (Algorithms and Lower bounds for Selection Problems)
17/06/2609:45 - 11:00Arijit GhoshVC Theory and PAC Learning
17/06/2611:15 - 12:30Vikram SharmaCombinatorics and Topology
17/06/2614:00 - 15:15Venkat GuruswamiThe Power of Subspace Designs: Optimal List Decoding, Proximity gaps, and More
18/06/2609:45 - 11:00Shivesh K. RoySunflower Lemma and Its Applications
18/06/2611:15 - 12:30Vikram SharmaCombinatorics and Topology
18/06/2614:00 - 15:15Mohanapriya ABudget-feasible Egalitarian Allocation of Conflicting Jobs
18/06/2615:30 - 16:45Abhijith R NairThe math behind fixed point algorithms
19/06/2609:45 - 11:00Lawqueen KaneshNP-Completeness and Beyond
19/06/2611:15 - 12:30Govind RIntroduction to Model Checking
19/06/2614:00 - 15:15Debasish PattanayakIntroduction to Distributed Computing
19/06/2615:30 - 16:45Sravanthi ChedeIntroduction to Proof Complexity
20/06/2609:45 - 11:00Lawqueen KaneshNP-Completeness and Beyond
20/06/2611:15 - 12:30Soumi NandiHitting Set and Bounded VC Dimension

WEEK 2

#
DateSlotSpeakerTopic
22/06/2609:45 - 11:00Ramya CIntroduction to Coding Theory
22/06/2611:15 - 12:30V ArvindEigenvalues of Graphs
22/06/2614:00 - 15:15Vaibhav KrishnanPolynomials and Computation
22/06/2615:30 - 16:45Satya AmarDiagonalization and Beyond
23/06/2609:45 - 11:00Ramya CIntroduction to Coding Theory
23/06/2611:15 - 12:30V ArvindEigenvalues of Graphs
23/06/2614:00 - 15:15Ishan ChakrabortyCactus representation of mincuts
23/06/2615:30 - 16:45Hitesh WankhedeTutorial (Eigenvalues of Graphs)
24/06/2609:45 - 11:00Prakash SaivasanAspects of computing
24/06/2611:15 - 12:30Prakash SaivasanAspects of computing
24/06/2614:00 - 15:15Sanjay SeetharamanIntroduction to Linear Programming
24/06/2615:30 - 16:45Sobyasachi ChatterjeeConnected Vertex Cover: A 2^k Algorithm
25/06/2609:45 - 11:00Prakash SaivasanAspects of computing
25/06/2611:15 - 12:30Prakash SaivasanAspects of computing
25/06/2614:00 - 15:15Sanjay SeetharamanIntroduction to Linear Programming
25/06/2615:30 - 16:45Hitesh WankhedeCombinatorics and Roots of Polynomials
27/06/2609:45 - 11:00Gopinath MishraIntroduction to Randomized Algorithms
27/06/2611:15 - 11:45Singanporia Kushal PiyushkumarHow to Guard A Museum?
27/06/2611:45 - 12:15Roseline Jerry AloorPolynomial Identity Testing
27/06/2612:15 - 12:30ClosingClosing

Frequently Asked Questions (FAQs)

#
  1. Is there any charge for accommodation for accommodated students?
    No, accommodation is free for accommodated students.
  2. Do accommodated students need to pay for meals?
    No, accommodated students will receive breakfast, lunch, and dinner for free.
  3. Will non-accommodated students receive meals?
    Non-accommodated students will only get lunch for free. They will not receive breakfast or dinner.
  4. Is lunch free for everyone?
    Yes, lunch is free for both accommodated and non-accommodated students.
  5. Will I receive a certificate of attendance?
    Yes, a certificate of attendance will be provided upon completion of the program.
  6. 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.
  7. 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.
  8. 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