Ninad Rajgopal

According to our database, Ninad Rajgopal authored at least 14 papers between 2013 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Frontier Space-Time Algorithms Using Only Full Memory.

Petr Chmel, Aditi Dudeja, Michal Koucký, Ian Mertz, Ninad Rajgopal

CoRR, February, 2026

2024

On the Power of Interactive Proofs for Learning.

Tom Gur, Mohammad Mahdi Jahanara, Mohammad Mahdi Khodabandeh, Ninad Rajgopal, Bahar Salamatian, Igor Shinkar

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Distribution-Free Proofs of Proximity.

Hugo Aaronson, Tom Gur, Ninad Rajgopal, Ron D. Rothblum

Proceedings of the 39th Computational Complexity Conference, 2024

2021

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

Proceedings of the EAAMO 2021: ACM Conference on Equity and Access in Algorithms, Mechanisms, and Optimization, Virtual Event, USA, October 5, 2021

On the Structure of Learnability Beyond P/Poly.

Ninad Rajgopal, Rahul Santhanam

Proceedings of the Approximation, 2021

2020

The complexity of meta-computational problems.

Ninad Rajgopal

PhD thesis, 2020

Improved learning of <i>k</i>-parities.

Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal

Theor. Comput. Sci., 2020

Optimally Deceiving a Learning Leader in Stackelberg Games.

Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo Cossío, Ninad Rajgopal, Alexandros A. Voudouris

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Beyond Natural Proofs: Hardness Magnification and Locality.

Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2018

Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds.

Ninad Rajgopal, Rahul Santhanam, Srikanth Srinivasan

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Improved Learning of k-Parities.

Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2016

Selection Lemmas for Various Geometric Objects.

Pradeesha Ashok, Sathish Govindarajan, Ninad Rajgopal

Int. J. Comput. Geom. Appl., 2016

2015

On learning k-parities with and without noise.

Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal

CoRR, 2015

2013

Hitting and Piercing Rectangles Induced by a Point Set.

Ninad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013