Gaurav Sood
Senior Research Fellow
Theoretical Computer Science
The Institute of Mathematical Sciences, Chennai
Email: gauravs AT imsc DOT res DOT in
I am a PhD student working under Prof. Meena Mahajan. I have been working primarily in proof complexity.
Publications
(As per the convention in theoretical computer science, all publications have authors listed in the alphabetical order of last names)

QBF Merge Resolution is powerful but unnatural.
Meena Mahajan and Gaurav Sood.
To appear in the proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022).
Preprint at arXiv.

Hard QBFs for Merge Resolution.
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomas Peitl, and Gaurav Sood.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020),
LIPIcs vol 182, pp. 12:112:15.
Full version at ECCC.
 MaxSAT Resolution and Subcube Sums.
Yuval Filmus, Meena Mahajan, Gaurav Sood, and Marc Vinyals.
Proceedings of the 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT 2020), LNCS 12178,
pp. 295311.
Full version at ECCC.
 On the computational complexity of Data Flow Analysis over finite bounded meet semilattices.
Gaurav Sood and K. Murali Krishnan.
Theoretical Computer Science, Volume 885, 11 September 2021, pp. 3040.