Ninad Rajgopal

Orcid: 0000-0001-6945-2345

According to our database1, Ninad Rajgopal authored at least 13 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the Power of Interactive Proofs for Learning.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
Distribution-Free Proofs of Proximity.
Electron. Colloquium Comput. Complex., 2023

2021
Optimally Deceiving a Learning Leader in Stackelberg Games.
J. Artif. Intell. Res., 2021

On the Structure of Learnability beyond P/poly.
Electron. Colloquium Comput. Complex., 2021

Optimal Testing and Containment Strategies for Universities in Mexico amid COVID-19✱.
Proceedings of the EAAMO 2021: ACM Conference on Equity and Access in Algorithms, Mechanisms, and Optimization, Virtual Event, USA, October 5, 2021

2020
The complexity of meta-computational problems.
PhD thesis, 2020

Improved learning of <i>k</i>-parities.
Theor. Comput. Sci., 2020

2019
Beyond Natural Proofs: Hardness Magnification and Locality.
Electron. Colloquium Comput. Complex., 2019

2018
Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Improved Learning of k-Parities.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2016
Selection Lemmas for Various Geometric Objects.
Int. J. Comput. Geom. Appl., 2016

2015
On learning k-parities with and without noise.
CoRR, 2015

2013
Hitting and Piercing Rectangles Induced by a Point Set.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013


  Loading...