Course title | Instructor(s) |
---|---|
Automata and Computability | Jaikumar Radhakrishnan, Paritosh K Pandya |
Mathematical Foundations for Computer Science | Manoj Gopalkrishnan |
Algorithms and Data Structures | Kavitha Telikepalli |
Topics in Quantum Information Theory | Naresh Sharma |
Boolean Circuit Complexity | Arkadev Chattopadhyay |
Probability & Computing | Prahladh Harsha |
Introduction to Term Rewriting (Reading Course) | N Raja |
Outline of Logic | N Raja |
Recent Results in Theoretical Computer Science (Reading Course) | Prahladh Harsha |
Monte Carlo Methods and Rare Events | Sandeep K Juneja |
Course title | Instructor(s) |
---|---|
Approximation Algorithms for Graph and Geometric Problems | Subir K Ghosh |
Computational Complexity | Prahladh Harsha |
Semantics of Computation | N Raja |
Foundations of Program Verification | Paritosh K Pandya |
Topics in Combinatorial Optimization | Kavitha Telikepalli |
Quantum computation and information | Pranab Sen |
Network Information Theory | Vinod M. Prabhakaran |
Advanced Probability | Sandeep K Juneja |
Approximation algorithms using SDP hierarchies (Reading Course) | Prahladh Harsha |
Wireless Communication | Rahul Vaze |