Scholar
Samir Datta
Google Scholar ID: rQj5IIkAAAAJ
Professor of Computer Science, Chennai Mathematical Institute
Citations & Impact
Citations
257
H-index
9
i10-index
8
Publications
20
Co-authors
38
list available
Contact
No contact links provided.
Publications
Resume (English only)
Academic Achievements
- Has a list of publications in Complexity and Networks, available on his personal website.
Research Experience
- Mainly focused on computational complexity, particularly the bounded space complexity of various graph problems, especially when restricted to planar graphs and related graph classes such as bounded tree width, bounded genus, H-minor free, etc. The problems range from very simple like reachability to NP-hard problems like Steiner Tree, including intermediate ones like restricted versions of the circuit value problem, embedding on surfaces, matching problems, and graph isomorphism. Also worked in circuit complexity, mainly providing alternative characterizations and proving properties of arithmetic circuits. Other sporadic ventures include complexity aspects of game theory, proof theory, and numerical analysis.
Background
- Professor with a broad area of interest in Theoretical Computer Science, specializing in Computational Complexity Theory. Has dabbled in Computer Networks.
Miscellany
- Personal interests include photography and other unspecified hobbies.
