(As per the convention in Theoretical Computer Science, authors are listed in alphabetical order of the last name.) 

• QBF Merge Resolution is powerful but unnatural

Authors: Meena Mahajan and Gaurav Sood

Logical Methods in Computer Science, Vol. 20, Issue 3, pp. 22:1–22:28 (September 2024)

Preliminary version appeared 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

• Hard QBFs for Merge Resolution

Authors: Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl and Gaurav Sood

ACM Transactions on Computation Theory, Vol. 16, Issue 2, Article No. 6 (June 2024)

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, LIPIcs Vol. 182, pp. 12:1-12:15 

• MaxSAT Resolution and Subcube Sums

Authors: Yuval Filmus, Meena Mahajan, Gaurav Sood and Marc Vinyals

ACM Transactions on Computational Logic, Vol. 24, Issue 1, Article No. 8 (January 2023)

Preliminary version appeared in the proceedings of the 23th International Conference on Theory and Applications of Satisfiability Testing (SAT 2020), Alghero, Italy, LNCS Vol. 12178, pp. 295-311

• On the computational complexity of Data Flow Analysis over finite bounded meet semilattices

Authors: Gaurav Sood and K. Murali Krishnan

Theoretical Computer Science, Vol. 885, pp. 30-40 (September 2021)