default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNinad Rajgopal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Hugo Aaronson, Tom Gur
, Ninad Rajgopal, Ron D. Rothblum:
Distribution-Free Proofs of Proximity. CCC 2024: 24:1-24:18- [c8]Tom Gur, Mohammad Mahdi Jahanara, Mohammad Mahdi Khodabandeh, Ninad Rajgopal, Bahar Salamatian, Igor Shinkar:
On the Power of Interactive Proofs for Learning. STOC 2024: 1063-1070 - [i10]Tom Gur, Mohammad Mahdi Jahanara, Mohammad Mahdi Khodabandeh, Ninad Rajgopal, Bahar Salamatian, Igor Shinkar:
On the Power of Interactive Proofs for Learning. CoRR abs/2404.08158 (2024) - 2023
- [i9]Luis Alejandro Benavides-Vázquez, Héctor Alonso Guzmán-Gutiérrez, Jakob Jonnerby, Philip Lazos, Edwin Lock, Francisco J. Marmolejo Cossío, Ninad Rajgopal, José Roberto Tello-Ayala:
Optimal Testing and Containment Strategies for Universities in Mexico amid COVID-19. CoRR abs/2306.17191 (2023) - [i8]Hugo Aaronson, Tom Gur, Ninad Rajgopal, Ron D. Rothblum:
Distribution-Free Proofs of Proximity. CoRR abs/2308.08874 (2023) - [i7]Hugo Aaronson, Tom Gur, Ninad Rajgopal, Ron Rothblum:
Distribution-Free Proofs of Proximity. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j4]Lijie Chen, Shuichi Hirahara, Igor Carboni Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. J. ACM 69(4): 25:1-25:49 (2022) - 2021
- [j3]Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo Cossío, Ninad Rajgopal, Alexandros A. Voudouris:
Optimally Deceiving a Learning Leader in Stackelberg Games. J. Artif. Intell. Res. 72: 507-531 (2021) - [c7]Ninad Rajgopal, Rahul Santhanam:
On the Structure of Learnability Beyond P/Poly. APPROX-RANDOM 2021: 46:1-46:23 - [c6]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:
Optimal Testing and Containment Strategies for Universities in Mexico amid COVID-19✱. EAAMO 2021: 12:1-12:9 - [i6]Ninad Rajgopal, Rahul Santhanam:
On the Structure of Learnability beyond P/poly. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [b1]Ninad Rajgopal:
The complexity of meta-computational problems. University of Oxford, UK, 2020 - [j2]Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal:
Improved learning of k-parities. Theor. Comput. Sci. 840: 249-256 (2020) - [c5]Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. ITCS 2020: 70:1-70:48 - [c4]Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo Cossío, Ninad Rajgopal, Alexandros A. Voudouris:
Optimally Deceiving a Learning Leader in Stackelberg Games. NeurIPS 2020 - [i5]Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo Cossío, Ninad Rajgopal, Alexandros A. Voudouris:
Optimally Deceiving a Learning Leader in Stackelberg Games. CoRR abs/2006.06566 (2020)
2010 – 2019
- 2019
- [i4]Lijie Chen, Shuichi Hirahara, Igor C. Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. CoRR abs/1911.08297 (2019) - [i3]Igor Carboni Oliveira, Lijie Chen, Shuichi Hirahara, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c3]Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal:
Improved Learning of k-Parities. COCOON 2018: 542-553 - [c2]Ninad Rajgopal, Rahul Santhanam, Srikanth Srinivasan:
Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds. MFCS 2018: 78:1-78:15 - 2016
- [j1]Pradeesha Ashok, Sathish Govindarajan, Ninad Rajgopal:
Selection Lemmas for Various Geometric Objects. Int. J. Comput. Geom. Appl. 26(2): 67-88 (2016) - 2015
- [i2]Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal:
On learning k-parities with and without noise. CoRR abs/1502.05375 (2015) - 2014
- [i1]Pradeesha Ashok, Ninad Rajgopal, Sathish Govindarajan:
Selection Lemmas for various geometric objects. CoRR abs/1401.0443 (2014) - 2013
- [c1]Ninad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra:
Hitting and Piercing Rectangles Induced by a Point Set. COCOON 2013: 221-232
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
