Samir Datta

Samir Datta is a Professor at the Chennai Mathematical Institute, where he conducts research in Theoretical Computer Science with a focus on Computational Complexity Theory. His work spans foundational graph problems, circuit complexity, and interdisciplinary applications in logic and numerical analysis.

His research interests include:

• Bounded space complexity in restricted graph classes (planar graphs, bounded tree-width, H-minor free graphs)
• Reachability, graph isomorphism, matching, and Steiner Tree problems
• Characterizations and properties of arithmetic circuits
• Complexity aspects of game theory, proof theory, and numerical analysis

His publications reflect a deep engagement with structural complexity and algorithmic graph theory. While specific titles are referenced, a detailed list is not provided in the source text.

He has advised both current and past students, though their names are not listed. No scientific awards are mentioned in the available information.

He is actively involved in research and academic mentoring at CMI, with no indication of part-time status, retirement, or former affiliation.