On the computational complexity of Data Flow Analysis - Gaurav Sood 001; K. Murali Krishnan 001 (CoRR, 2013)

Hard QBFs for Merge Resolution. - Olaf Beyersdorff; Joshua Blinkhorn; Meena Mahajan; Tomás Peitl; Gaurav Sood 001 (Electron. Colloquium Comput. Complex., 2020)

MaxSAT Resolution and Subcube Sums. - Yuval Filmus; Meena Mahajan; Gaurav Sood 001; Marc Vinyals (Electron. Colloquium Comput. Complex., 2020)

On the computational complexity of Data Flow Analysis over finite bounded meet semilattices. - Gaurav Sood 001; K. Murali Krishnan 001 (Theor. Comput. Sci., 2021)

QBF Merge Resolution is powerful but unnatural. - Meena Mahajan; Gaurav Sood 001 (Electron. Colloquium Comput. Complex., 2022)