Hitting and Piercing Rectangles Induced by a Point Set. - Ninad Rajgopal; Pradeesha Ashok; Sathish Govindarajan; Abhijit Khopkar; Neeldhara Misra (COCOON, 2013)

On learning k-parities with and without noise. - Arnab Bhattacharyya 001; Ameet Gadekar; Ninad Rajgopal (CoRR, 2015)

Selection Lemmas for Various Geometric Objects. - Pradeesha Ashok; Sathish Govindarajan; Ninad Rajgopal (Int. J. Comput. Geom. Appl., 2016)

Improved Learning of k-Parities. - Arnab Bhattacharyya 001; Ameet Gadekar; Ninad Rajgopal (COCOON, 2018)

Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds. - Ninad Rajgopal; Rahul Santhanam; Srikanth Srinivasan 001 (MFCS, 2018)

Beyond Natural Proofs: Hardness Magnification and Locality. - Igor Carboni Oliveira; Lijie Chen 001; Shuichi Hirahara; Ján Pich; Ninad Rajgopal; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2019)

Improved learning of k-parities. - Arnab Bhattacharyya 001; Ameet Gadekar; Ninad Rajgopal (Theor. Comput. Sci., 2020)

The complexity of meta-computational problems. - Ninad Rajgopal (2020)

Optimal Testing and Containment Strategies for Universities in Mexico amid COVID-19✱. - Edwin Lock; Francisco Javier Marmolejo Cossío; Jakob Jonnerby; Ninad Rajgopal; Héctor Alonso Guzmán-Gutiérrez; Luis Alejandro Benavides-Vázquez; José Roberto Tello-Ayala; Philip Lazos (EAAMO, 2021)

Optimally Deceiving a Learning Leader in Stackelberg Games. - Georgios Birmpas; Jiarui Gan; Alexandros Hollender; Francisco J. Marmolejo Cossío; Ninad Rajgopal; Alexandros A. Voudouris (J. Artif. Intell. Res., 2021)

Distribution-Free Proofs of Proximity. - Hugo Aaronson; Tom Gur; Ninad Rajgopal; Ron Rothblum (Electron. Colloquium Comput. Complex., 2023)

On the Power of Interactive Proofs for Learning. - Tom Gur; Mohammad Mahdi Jahanara; Mohammad Mahdi Khodabandeh; Ninad Rajgopal; Bahar Salamatian; Igor Shinkar (STOC, 2024)

On the Structure of Learnability beyond P/poly. - Ninad Rajgopal; Rahul Santhanam (Comput. Complex., 2025)