Ashish V. Naik

Publication Activity (10 Years)

Years Active: 1993-2003
Publications (10 Years): 0

Publications

Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers
Inverting onto functions. Inf. Comput. 186 (1) (2003)
Ashish V. Naik, Alan L. Selman
Adaptive Versus Nonadaptive Queries to NP and p-Selective Sets. Comput. Complex. 8 (2) (1999)
Ashish V. Naik, John D. Rogers, James S. Royer, Alan L. Selman
A Hierarchy Based on Output Multiplicity. Theor. Comput. Sci. 207 (1) (1998)
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) (1998)
Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik
On Coherence, Random-Self-Reducibility, and Self-Correction. Comput. Complex. 7 (2) (1998)
Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik
On Coherence, Random-self-reducibility, and Self-correction. Computational Complexity Conference (1996)
Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
Computing Solutions Uniquely Collapses the Polynomial Hierarchy Electron. Colloquium Comput. Complex. 3 (27) (1996)
Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
Computing Solutions Uniquely Collapses the Polynomial Hierarchy. SIAM J. Comput. 25 (4) (1996)
Ashish V. Naik, Alan L. Selman
A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP. Computational Complexity Conference (1996)
Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers
Inverting Onto Functions. Computational Complexity Conference (1996)
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) (1996)
Jin-yi Cai, Ashish V. Naik, D. Sivakumar
On the Existence of Hard Sparse Sets under Weak Reductions. STACS (1996)
Ashish V. Naik, Kenneth W. Regan, D. Sivakumar
On Quasilinear-Time Complexity Theory. Theor. Comput. Sci. 148 (2) (1995)
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) (1995)
Ashish V. Naik, Kenneth W. Regan, D. Sivakumar
Quasilinear Time Complexity Theory. STACS (1994)
Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
Computing Solutions Uniquely collapses the Polynomial Hierarchy. ISAAC (1994)
Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman
P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability. Computational Complexity Conference (1993)