Note: In theoretical computer science, the names of the authors are listed in order of surname under the Hardy-Littlewood rule.
Testing Equivalence to the Hamiltonian Cycle Polynomial. [pdf]
To appear in the proceedings of the 51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026). Recipient of best student paper award.
NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant Support Polynomials. [pdf]
Joint work with Omkar Baraskar, Chandan Saha and Pulkit Sinha.
Published in the proceedings of the 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP 2024).
Proceedings version: https://doi.org/10.4230/LIPIcs.ICALP.2024.16
Full version: https://eccc.weizmann.ac.il/report/2024/104
Extended version: https://doi.org/10.48550/arXiv.2410.12251
Testing Equivalence to Design Polynomials. [pdf]
Joint work with Omkar Baraskar and Chandan Saha.
Published in the proceedings of the 41st Symposium on Theoretical Aspects of Computer Science (STACS 2024).
Proceedings version: https://doi.org/10.4230/LIPIcs.STACS.2024.9
Full version: https://eccc.weizmann.ac.il/report/2024/004/
As an undergrad, I interned at the Computer Science department of the Indian Institute of Technology, Ropar and was fortunate to be supervised by Prof Balwinder Sodhi. The work culminated in the following publications:
BloatLibD: Detecting Bloat Libraries in Java Applications.
Joint work with Poojith Rao, Balwinder Sodhi and Ritu Kapur.
Published in the proceedings of Evaluation of Novel Approaches to Software Engineering (ENASE 2021).
Proceedings version: https://doi.org/10.5220/0010459401260137
XtraLibD: Detecting Irrelevant Third-Party Libraries in Java and Python Applications.
Joint work with Ritu Kapur, Poojith U Rao and Balwinder Sodhi. Selected paper in Evaluation of Novel Approaches to Software Engineering (ENASE 2021).
arXiv version: https://doi.org/10.48550/arXiv.2202.10776