default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaren Manoj
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Avrim Blum, Meghal Gupta, Gene Li, Naren Sarayu Manoj
, Aadirupa Saha, Yuanyuan Yang:
Dueling Optimization with a Monotone Adversary. ALT 2024: 221-243- [c5]Yury Makarychev, Naren Sarayu Manoj, Max Ovsiankin:
Near-Optimal Streaming Ellipsoidal Rounding for General Convex Polytopes. STOC 2024: 1526-1537 - 2023
- [c4]Naren Sarayu Manoj, Nathan Srebro:
Shortest Program Interpolation Learning. COLT 2023: 4881-4901 - [c3]Meghal Gupta, Naren Sarayu Manoj:
An Optimal Algorithm for Certifying Monotone Functions. SOSA 2023: 207-212 - [i10]Naren Sarayu Manoj, Nathan Srebro:
Interpolation Learning With Minimum Description Length. CoRR abs/2302.07263 (2023) - [i9]Yury Makarychev, Naren Sarayu Manoj, Max Ovsiankin:
Near-Optimal Streaming Ellipsoidal Rounding for General Convex Polytopes. CoRR abs/2311.09460 (2023) - [i8]Naren Sarayu Manoj, Max Ovsiankin:
The Change-of-Measure Method, Block Lewis Weights, and Approximating Matrix Block Norms. CoRR abs/2311.10013 (2023) - [i7]Avrim Blum, Meghal Gupta, Gene Li, Naren Sarayu Manoj, Aadirupa Saha, Yuanyuan Yang:
Dueling Optimization with a Monotone Adversary. CoRR abs/2311.11185 (2023) - 2022
- [c2]Yury Makarychev, Naren Sarayu Manoj, Max Ovsiankin:
Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes. COLT 2022: 3070-3093 - [i6]Meghal Gupta, Naren Sarayu Manoj:
An Optimal Algorithm for Certifying Monotone Functions. CoRR abs/2204.01224 (2022) - [i5]Yury Makarychev, Naren Sarayu Manoj, Max Ovsiankin:
Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes. CoRR abs/2206.07250 (2022) - [i4]Meghal Gupta, Naren Manoj:
An Optimal Algorithm for Certifying Monotone Functions. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c1]Naren Manoj, Avrim Blum:
Excess Capacity and Backdoor Poisoning. NeurIPS 2021: 20373-20384 - [i3]Naren Sarayu Manoj, Avrim Blum:
Excess Capacity and Backdoor Poisoning. CoRR abs/2109.00685 (2021) - 2020
- [j1]Avrim Blum, Travis Dick, Naren Manoj, Hongyang Zhang:
Random Smoothing Might be Unable to Certify L∞ Robustness for High-Dimensional Images. J. Mach. Learn. Res. 21: 211:1-211:21 (2020) - [i2]Avrim Blum, Travis Dick, Naren Manoj, Hongyang Zhang:
Random Smoothing Might be Unable to Certify 𝓁∞ Robustness for High-Dimensional Images. CoRR abs/2002.03517 (2020)
2010 – 2019
- 2019
- [i1]Matt Jordan, Naren Manoj, Surbhi Goel, Alexandros G. Dimakis:
Quantifying Perceptual Distortion of Adversarial Examples. CoRR abs/1902.08265 (2019)
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 21:21 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:
