Ashish V. Naik

17 papers A 5B 1Journal 10Unranked 1
YearRankTypeTitle / Venue / Authors
2003 J jnl
Inverting onto functions.
Inf. Comput.
Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers
1999 J jnl
Adaptive Versus Nonadaptive Queries to NP and p-Selective Sets.
Comput. Complex.
Ashish V. Naik, Alan L. Selman
1998 J jnl
A Hierarchy Based on Output Multiplicity.
Theor. Comput. Sci.
Ashish V. Naik, John D. Rogers, James S. Royer, Alan L. Selman
1998 J jnl
Efficient Algorithms for a Scheduling Problem and its Applications to Illicit Drug Market Crackdowns.
J. Comb. Optim.
Pu Cai, Jin-Yi Cai, Ashish V. Naik
1998 J jnl
On Coherence, Random-Self-Reducibility, and Self-Correction.
Comput. Complex.
Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik
1996 A conf
A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP.
CCC
Ashish V. Naik, Alan L. Selman
1996 J jnl
Computing Solutions Uniquely Collapses the Polynomial Hierarchy
Electron. Colloquium Comput. Complex.
Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
1996 J jnl
Computing Solutions Uniquely Collapses the Polynomial Hierarchy.
SIAM J. Comput.
Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
1996 A conf
Inverting Onto Functions.
CCC
Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers
1996 A conf
On Coherence, Random-self-reducibility, and Self-correction.
CCC
Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik
1996 A conf
On the Existence of Hard Sparse Sets under Weak Reductions.
STACS
Jin-Yi Cai, Ashish V. Naik, D. Sivakumar
1996 J jnl
P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility.
J. Comput. Syst. Sci.
Edith Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
1995 J jnl
Nondeterministically Selective Sets.
Int. J. Found. Comput. Sci.
Lane A. Hemaspaandra, Albrecht Hoene, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman, Thomas Thierauf, Jie Wang
1995 J jnl
On Quasilinear-Time Complexity Theory.
Theor. Comput. Sci.
Ashish V. Naik, Kenneth W. Regan, D. Sivakumar
1994 B conf
Computing Solutions Uniquely collapses the Polynomial Hierarchy.
ISAAC
Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
1994 A conf
Quasilinear Time Complexity Theory.
STACS
Ashish V. Naik, Kenneth W. Regan, D. Sivakumar
1993 — conf
P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability.
SCT
Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman