Theoretical Computer Science

The primary research focus of the theoretical computer science (tcs) group at IMSc is on the mathematical foundations of computation.  These include algorithms, logic, automata theory, combinatorics, and computational complexity. The group currently comprises of nine faculty members,  post-doctoral fellows, and doctoral research scholars.  The activities of the group include running a highly challenging graduate programme for doctoral students, holding research seminars, and organising research-level workshops and conferences as well as instructional schools and workshops.

The current research interests of the tcs faculty are in the following broad areas.

  • Logic, Automata and Concurrency (Concurrency theory, temporal and epistemic logics, automata theory and logical foundations, game theory, security theory):  Kamal Lodaya, R Ramanujam
  • Algorithms, Combinatorics and Data Structures (Parameterized algorithms and complexity, succinct data structures, space-efficient algorithms, graph theory and algorithms, symbolic and algebraic computation, combinatorial and computational geometry, optimization, probabilistic combinatorics) Venkatesh Raman, Saket Saurabh, Vikram Sharma, C R Subramanian, Arijit Ghosh
  • Computational Complexity (Algebraic computation, Boolean functions and circuits, graph isomorphism, polynomial identity testing, proof complexity): V Arvind, Meena Mahajan