default search action
Ashish V. Naik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
- [j9]Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers:
Inverting onto functions. Inf. Comput. 186(1): 90-103 (2003)
1990 – 1999
- 1999
- [j8]Ashish V. Naik, Alan L. Selman:
Adaptive Versus Nonadaptive Queries to NP and p-Selective Sets. Comput. Complex. 8(2): 169-187 (1999) - 1998
- [j7]Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik:
On Coherence, Random-Self-Reducibility, and Self-Correction. Comput. Complex. 7(2): 174-191 (1998) - [j6]Pu Cai, Jin-yi Cai, Ashish V. Naik:
Efficient Algorithms for a Scheduling Problem and its Applications to Illicit Drug Market Crackdowns. J. Comb. Optim. 1(4): 367-376 (1998) - [j5]Ashish V. Naik, John D. Rogers, James S. Royer, Alan L. Selman:
A Hierarchy Based on Output Multiplicity. Theor. Comput. Sci. 207(1): 131-157 (1998) - 1996
- [j4]Edith Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman:
P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility. J. Comput. Syst. Sci. 53(2): 194-209 (1996) - [j3]Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman:
Computing Solutions Uniquely Collapses the Polynomial Hierarchy. SIAM J. Comput. 25(4): 697-708 (1996) - [c7]Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik:
On Coherence, Random-self-reducibility, and Self-correction. CCC 1996: 59-67 - [c6]Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers:
Inverting Onto Functions. CCC 1996: 213-222 - [c5]Ashish V. Naik, Alan L. Selman:
A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP. CCC 1996: 224-232 - [c4]Jin-yi Cai, Ashish V. Naik, D. Sivakumar:
On the Existence of Hard Sparse Sets under Weak Reductions. STACS 1996: 307-318 - [i1]Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman:
Computing Solutions Uniquely Collapses the Polynomial Hierarchy. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j2]Lane A. Hemaspaandra, Albrecht Hoene, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman, Thomas Thierauf, Jie Wang:
Nondeterministically Selective Sets. Int. J. Found. Comput. Sci. 6(4): 403-416 (1995) - [j1]Ashish V. Naik, Kenneth W. Regan, D. Sivakumar:
On Quasilinear-Time Complexity Theory. Theor. Comput. Sci. 148(2): 325-349 (1995) - 1994
- [c3]Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman:
Computing Solutions Uniquely collapses the Polynomial Hierarchy. ISAAC 1994: 56-64 - [c2]Ashish V. Naik, Kenneth W. Regan, D. Sivakumar:
Quasilinear Time Complexity Theory. STACS 1994: 97-108 - 1993
- [c1]Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman:
P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability. SCT 1993: 52-64
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-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint