Yes. Saket Saurabh did win the said prize in Mathematical Sciences in 2021. He is the Professor of Theoretical Computer Science at the Institute of Mathematical Sciences (IMSc), Chennai and an adjunct faculty at University of Bergen, Norway. He specializes in parameterized complexity, exponential algorithm, graph theory and algorithmic game theory which are different fields of computation.
We’ve seen what algorithms are. Hard algorithmic problems are dealt with in parameterized complexity. Exponential algorithm is used to sort infinite range. Graph theory deals with the study of graphs. Algorithmic game theory combines algorithmic thinking with theoretical ideas.
Saurabh got BSc (Honours) in Mathematics and MSc in Computer Science from Chennai Mathematical Institute. He did his PhD in Theoretical Computer Science from Indian Institute of Mathematical Science (IMSc) and became a faculty member later.
He had worked as a research assistant at the University of Bergen and also did post-doctoral studies there. He received a European Research Council Grant twice, and is a recipient of the 2020 ACM India Early Career Researcher Award. He was elected as a Fellow of the Indian Academy of Sciences in 2020. He has also co-authored two books- Parameterized Algorithms and Kernelization: Theory of Parameterized Preprocessing.
Picture Credit : Google
