Sajin Koroth

Sajin Koroth is an Assistant Professor in the Department of Computer Science at the University of Victoria, Canada. He holds a PhD from the Indian Institute of Technology Madras and has held postdoctoral positions at Simon Fraser University and the University of Haifa. His research focuses on theoretical computer science, particularly complexity theory, communication complexity, and circuit complexity. He has received the IBM India Outstanding Ph.D. Thesis Award for his doctoral work.

Education: PhD and Master's from IIT Madras, postdoctoral research at SFU and Haifa University. Research interests include circuit lower bounds, communication complexity, and probabilistically checkable proofs (PCPs). Key contributions involve lifting theorems, query-to-communication complexity, and lower bounds for De Morgan formulas.

Awards: IBM India Outstanding Ph.D. Thesis Award (2017). Teaching: Courses on communication complexity and computational complexity theory at UVic. Active in academic conferences and workshops, including presentations at STOC, CCC, and ICALP.