The SCEAS System
| |||||||

## Search the dblp DataBase
Ashish V. Naik:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers
**Inverting Onto Functions.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:213-222 [Conf] - Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik
**On Coherence, Random-self-reducibility, and Self-correction.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:59-67 [Conf] - Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman
**P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:52-64 [Conf] - Ashish V. Naik, Alan L. Selman
**A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:224-232 [Conf] - Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
**Computing Solutions Uniquely collapses the Polynomial Hierarchy.**[Citation Graph (0, 0)][DBLP] ISAAC, 1994, pp:56-64 [Conf] - Jin-yi Cai, Ashish V. Naik, D. Sivakumar
**On the Existence of Hard Sparse Sets under Weak Reductions.**[Citation Graph (0, 0)][DBLP] STACS, 1996, pp:307-318 [Conf] - Ashish V. Naik, Kenneth W. Regan, D. Sivakumar
**Quasilinear Time Complexity Theory.**[Citation Graph (0, 0)][DBLP] STACS, 1994, pp:97-108 [Conf] - Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik
**On Coherence, Random-Self-Reducibility, and Self-Correction.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1998, v:7, n:2, pp:174-191 [Journal] - Ashish V. Naik, Alan L. Selman
**Adaptive Versus Nonadaptive Queries to NP and p-Selective Sets.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1999, v:8, n:2, pp:169-187 [Journal] - Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
**Computing Solutions Uniquely Collapses the Polynomial Hierarchy**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:27, pp:- [Journal] - Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers
**Inverting onto functions.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2003, v:186, n:1, pp:90-103 [Journal] - Lane A. Hemaspaandra, Albrecht Hoene, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman, Thomas Thierauf, Jie Wang
**Nondeterministically Selective Sets.**[Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1995, v:6, n:4, pp:403-416 [Journal] - Pu Cai, Jin-yi Cai, Ashish V. Naik
**Efficient Algorithms for a Scheduling Problem and its Applications to Illicit Drug Market Crackdowns.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 1998, v:1, n:4, pp:367-376 [Journal] - Edith Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
**P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1996, v:53, n:2, pp:194-209 [Journal] - Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
**Computing Solutions Uniquely Collapses the Polynomial Hierarchy.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:4, pp:697-708 [Journal] - Ashish V. Naik, John D. Rogers, James S. Royer, Alan L. Selman
**A Hierarchy Based on Output Multiplicity.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:207, n:1, pp:131-157 [Journal] - Ashish V. Naik, Kenneth W. Regan, D. Sivakumar
**On Quasilinear-Time Complexity Theory.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1995, v:148, n:2, pp:325-349 [Journal]
Search in 0.003secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |