Obtaining Information Leakage Bounds via Approximate Model Counting. - Seemanta Saha; Surendra Ghentiyala; Shihua Lu; Lucas Bang; Tevfik Bultan (Proc. ACM Program. Lang., 2023)

More Basis Reduction for Linear Codes: Backward Reduction, BKZ, Slide Reduction, and More. - Surendra Ghentiyala; Noah Stephens-Davidowitz (APPROX/RANDOM, 2024)

The more the merrier! On the complexity of finding multicollisions, with connections to codes and lattices. - Huck Bennett; Surendra Ghentiyala; Noah Stephens-Davidowitz (Electron. Colloquium Comput. Complex., 2024)

New constructions of pseudorandom codes. - Surendra Ghentiyala; Venkatesan Guruswami (IACR Cryptol. ePrint Arch., 2024)

The More the Merrier! On Total Coding and Lattice Problems and the Complexity of Finding Multicollisions. - Huck Bennett; Surendra Ghentiyala; Noah Stephens-Davidowitz (ITCS, 2025)

Downward self-reducibility in the total function polynomial hierarchy. - Karthik Gajulapalli; Surendra Ghentiyala; Zeyong Li; Sidhant Saraogi (Electron. Colloquium Comput. Complex., 2025)

Hierarchies within TFNP: building blocks and collapses. - Surendra Ghentiyala; Zeyong Li (Electron. Colloquium Comput. Complex., 2025)