TCS Courses

Courses offered by the theoretical computer science group at IMSc

Graduate level courses covering various aspects of theoretical computer science are offered at IMSc in various formats: lecture-based courses, seminar-based courses, reading courses, etc. Here is a list of courses that have been offered in the last few years. Current courses (Jan-May2017 semester) are marked with an asterisk.

Discrete Mathematics Programming Languages Theory
Algorithms and Data Structures Advanced Data Structures*
Automata Theory and Computability Theory of Computation - 2*
Introduction to Logic Logic-2*
Introduction to Computational Complexity* Computational Complexity-2
Randomized Algorithms Computational Geometry
Algebra and Computation Algebra and Computation - 2
Distributed Algorithms Games and Computation
Automata and Concurrency Verification
Randomness and Computation Algebraic Theory of Automata
Circuit Complexity Parameterized Complexity*
Kernelization Infinite Discrete Structures
Concurrency Communication Complexity
Linear Programming and Combinatorial Optimization Mathematical Foundations of Computer Science
Graph Theory Algorithms for solving polynomial equations
Algorithms for special classes of graphs  Advanced Graph Agorithms
Approximation and Online Algorithms Dynamic Graph Algorithms
Concrete Lower Bounds Lower Bounds for Data Structures
Advanced Parameterized Complexity* The Polynomial Method*








Jun 28 - Alladi Ramakrishnan Hall - A Holographic form for Wilson's RG by B Sathiapalan
Jun 29 - Room 327 - TCS by Comprehensive Exam
Jun 29 - Media Centre - Parameterized complexity by Arindam Biswas
Jun 29 - Hall 123 - PJC by Pheno Journal Club
Jun 29 - Room 327 - Disjoint Path Problem by Arindam Biswas
Jun 30 - Room 327 - comprehensive by Gaurav Sood

More Seminars