Hi, I am Srijan Chakraborty.

I am a first year PhD at UWaterloo, advised by Sepehr Assadi and Rafael Oliveira.

My research interests lie in Algorithms and Complexity Theory, in particular, Graph Theory, Algebraic Algorithms, Circuit Complexity, and space bounded computation.

I graduated from Chennai Mathematical Institute, (CMI), in 2024. I did my masters in Computer Science at CMI, under the supervision of Samir Datta.

Contact: srijan [dot] chakraborty [At] uwaterloo [dot] ca, srijanc2604 [At] gmail [dot] com

Master’s Thesis: link

CV: link

Publications and Manuscripts :

Maximum Matching and Related Problems in Catalytic Logspace: arXiv, with Samir Datta, Aryan Kusre, Partha Mukhopadhyay, and Amit Sinhababu
Derandomizing Isolation In Catalytic Logspace: arXiv, with V. Arvind and Samir Datta
Fast exact algorithms via the Matrix Tree Theorem: arXiv, with V. Arvind, Samir Datta, and Asif Khan

Teachings :

Aug 2022 - Dec 2022, TA for Introduction to Programming in Haskell @ CMI
Aug 2023 - Dec 2023, TA for Design and Analysis of Algorithms @ CMI
Jan 2024 - May 2024, TA for Discrete Mathematics @ CMI
Jan 2025 - May 2025, TA for Computational Complexity Theory @ CMI
Jan 2026 - May 2026, TA for Parallel and Small Space Algorithms @ CMI