The Connected Domination Number of Grids. - Adarsh Srinivasan; N. S. Narayanaswamy (CALDAM, 2021)

A McEliece cryptosystem using permutation codes. - Adarsh Srinivasan; Ayan Mahalanobis (CoRR, 2021)

Impossibility of Depth Reduction in Explainable Clustering. - Chengyuan Deng; Surya Teja Gavva; Karthik C. S. 001; Parth Patel; Adarsh Srinivasan (CoRR, 2023)

On the geometry of k-SAT solutions: what more can PPZ and Schöning's algorithms do? - Per Austrin; Ioana O. Bercea; Mayank Goswami 001; Nutan Limaye; Adarsh Srinivasan (CoRR, 2024)

Container Data Item: An Abstract Datatype for Efficient Container-based Edge Computing. - Md Rezwanur Rahman; Tarun Annapareddy; Shirin Ebadi; Varsha Natarajan; Adarsh Srinivasan; Eric Keller; Shivakant Mishra (CoRR, 2024)

Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments. - Per Austrin; Ioana O. Bercea; Mayank Goswami 001; Nutan Limaye; Adarsh Srinivasan (ICALP, 2025)

#SAT-Algorithms for Classes of Threshold Circuits Based on Probabilistic Rank. - Nutan Limaye; Adarsh Srinivasan; Srikanth Srinivasan 001 (MFCS, 2025)