P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability. - Ashish V. Naik; Mitsunori Ogiwara; Alan L. Selman (SCT, 1993)

Nondeterministically Selective Sets. - Lane A. Hemaspaandra; Albrecht Hoene; Ashish V. Naik; Mitsunori Ogihara; Alan L. Selman; Thomas Thierauf; Jie Wang 002 (Int. J. Found. Comput. Sci., 1995)

On Quasilinear-Time Complexity Theory. - Ashish V. Naik; Kenneth W. Regan; D. Sivakumar (Theor. Comput. Sci., 1995)

A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP. - Ashish V. Naik; Alan L. Selman (CCC, 1996)

On the Existence of Hard Sparse Sets under Weak Reductions. - Jin-yi Cai; Ashish V. Naik; D. Sivakumar (STACS, 1996)

P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility. - Edith Hemaspaandra; Ashish V. Naik; Mitsunori Ogihara; Alan L. Selman (J. Comput. Syst. Sci., 1996)

Computing Solutions Uniquely Collapses the Polynomial Hierarchy. - Lane A. Hemaspaandra; Ashish V. Naik; Mitsunori Ogihara; Alan L. Selman (SIAM J. Comput., 1996)

On Coherence, Random-Self-Reducibility, and Self-Correction. - Joan Feigenbaum; Lance Fortnow; Sophie Laplante; Ashish V. Naik (Comput. Complex., 1998)

Efficient Algorithms for a Scheduling Problem and its Applications to Illicit Drug Market Crackdowns. - Pu Cai; Jin-yi Cai; Ashish V. Naik (J. Comb. Optim., 1998)

A Hierarchy Based on Output Multiplicity. - Ashish V. Naik; John D. Rogers; James S. Royer; Alan L. Selman (Theor. Comput. Sci., 1998)

Adaptive Versus Nonadaptive Queries to NP and p-Selective Sets. - Ashish V. Naik; Alan L. Selman (Comput. Complex., 1999)

Inverting onto functions. - Stephen A. Fenner; Lance Fortnow; Ashish V. Naik; John D. Rogers (Inf. Comput., 2003)