NP-completeness of the Active Time Scheduling Problem. - Sagnik Saha; Manish Purohit (CoRR, 2021)

ZHED is NP-complete. - Sagnik Saha; Erik D. Demaine (CCCG, 2022)

Automated Attribute Extraction from Legal Proceedings. - Subinay Adhikary; Sagnik Das; Sagnik Saha; Procheta Sen; Dwaipayan Roy 001; Kripabandhu Ghosh (CoRR, 2023)

k-SUM in the Sparse Regime. - Shweta Agrawal 001; Sagnik Saha; Nikolaj I. Schwartzbach; Akhil Vanukuri; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2023)

k-SUM in the Sparse Regime: Complexity and Applications. - Shweta Agrawal 001; Sagnik Saha; Nikolaj I. Schwartzbach; Akhil Vanukuri; Prashant Nalini Vasudevan (CRYPTO (2), 2024)

A Systematic Study of Sparse LWE. - Aayush Jain; Huijia Lin; Sagnik Saha (IACR Cryptol. ePrint Arch., 2024)