Ashish V. Naik

According to our database1, Ashish V. Naik authored at least 12 papers between 1993 and 2003.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2003
Inverting onto functions.
Inf. Comput., 2003

1999
Adaptive Versus Nonadaptive Queries to NP and p-Selective Sets.
Comput. Complex., 1999

1998
A Hierarchy Based on Output Multiplicity.
Theor. Comput. Sci., 1998

Efficient Algorithms for a Scheduling Problem and its Applications to Illicit Drug Market Crackdowns.
J. Comb. Optim., 1998

On Coherence, Random-Self-Reducibility, and Self-Correction.
Comput. Complex., 1998

1996
P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility.
J. Comput. Syst. Sci., 1996

Computing Solutions Uniquely Collapses the Polynomial Hierarchy
Electron. Colloquium Comput. Complex., 1996

On the Existence of Hard Sparse Sets under Weak Reductions.
Proceedings of the STACS 96, 1996

A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1995
On Quasilinear-Time Complexity Theory.
Theor. Comput. Sci., 1995

Nondeterministically Selective Sets.
Int. J. Found. Comput. Sci., 1995

1993
P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability.
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993


  Loading...