Key Research Areas

1. Theoretical Computer Science
2. Computational Complexity Theory
3. Proof Complexity

About

Dr. Gaurav Sood is an Assistant Professor at SCEE, IIT Mandi. Before joining IIT Mandi, he was a Postdoctoral Fellow under Dr. Yuval Filmus at Technion – Israel Institute of Technology, and later under Prof. Ilan Newman at the University of Haifa, Israel. He completed his Ph.D in Theoretical Computer Science from the Institute of Mathematical Sciences, Chennai, which is a constituent institute of Homi Bhabha National Institute, Mumbai.

Recent Publications

1. Meena Mahajan and Gaurav Sood, "QBF Merge Resolution is powerful but unnatural", in the proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022), Haifa, Israel, LIPIcs vol 236; pp. 22:1-22:19, doi:10.4230/LIPIcs.SAT.2022.22.
2. Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl and Gaurav Sood, "Hard QBFs for Merge Resolution", ACM Transactions on Computation Theory, vol 16, Issue 2, Article No. 6, doi:10.1145/3638263 (Preliminary version appeared in the proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), Goa, India (virtual conference) LIPIcs vol 182, pp. 12:1--12:15).
3. Yuval Filmus, Meena Mahajan, Gaurav Sood and Marc Vinyals, "MaxSAT Resolution and Subcube Sums", ACM Transactions on Computational Logic, vol 24, Issue 1, Article No. 8, doi:10.1145/3565363 (Preliminary version appeared in the proceedings of the 23th International Conference on Theory and Applications of Satisfiability Testing (SAT 2020), Alghero, Italy (virtual conference), LNCS vol 12178, pp. 295-311). Gaurav Sood and K. Murali Krishnan, "On the computational complexity of Data Flow Analysis over finite bounded meet semilattices", Theoretical Computer Science, vol 885, pp. 30-40, doi:10.1016/j.tcs.2021.06.019.

Course Taught

1. CS511 Probability
2. CS512 Linear Algebra

...
Gaurav Sood

Designation: Assistant Professor