Ashish V. Naik

2003
17	EE	Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers: Inverting onto functions. Inf. Comput. 186(1): 90-103 (2003)
1999
16		Ashish V. Naik, Alan L. Selman: Adaptive Versus Nonadaptive Queries to NP and p-Selective Sets. Computational Complexity 8(2): 169-187 (1999)
1998
15		Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik: On Coherence, Random-Self-Reducibility, and Self-Correction. Computational Complexity 7(2): 174-191 (1998)
14		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): 367-376 (1998)
13	EE	Ashish V. Naik, John D. Rogers, James S. Royer, Alan L. Selman: A Hierarchy Based on Output Multiplicity. Theor. Comput. Sci. 207(1): 131-157 (1998)
1996
12	EE	Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers: Inverting Onto Functions. IEEE Conference on Computational Complexity 1996: 213-222
11	EE	Ashish V. Naik, Alan L. Selman: A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP. IEEE Conference on Computational Complexity 1996: 224-232
10	EE	Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik: On Coherence, Random-self-reducibility, and Self-correction. IEEE Conference on Computational Complexity 1996: 59-67
9		Jin-yi Cai, Ashish V. Naik, D. Sivakumar: On the Existence of Hard Sparse Sets under Weak Reductions. STACS 1996: 307-318
8	EE	Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman: Computing Solutions Uniquely Collapses the Polynomial Hierarchy Electronic Colloquium on Computational Complexity (ECCC) 3(27): (1996)
7		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): 194-209 (1996)
6		Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman: Computing Solutions Uniquely Collapses the Polynomial Hierarchy. SIAM J. Comput. 25(4): 697-708 (1996)
1995
5		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): 403-416 (1995)
4	EE	Ashish V. Naik, Kenneth W. Regan, D. Sivakumar: On Quasilinear-Time Complexity Theory. Theor. Comput. Sci. 148(2): 325-349 (1995)
1994
3		Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman: Computing Solutions Uniquely collapses the Polynomial Hierarchy. ISAAC 1994: 56-64
2		Ashish V. Naik, Kenneth W. Regan, D. Sivakumar: Quasilinear Time Complexity Theory. STACS 1994: 97-108
1993
1		Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman: P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability. Structure in Complexity Theory Conference 1993: 52-64

Coauthor Index

1	Jin-yi Cai	[9] [14]
2	Pu Cai	[14]
3	Joan Feigenbaum	[10] [15]
4	Stephen A. Fenner	[12] [17]
5	Lance Fortnow	[10] [12] [15] [17]
6	Edith Hemaspaandra (Edith Spaan)	[7]
7	Lane A. Hemaspaandra (Lane A. Hemachandra)	[3] [5] [6] [8]
8	Albrecht Hoene	[5]
9	Sophie Laplante	[10] [15]
10	Mitsunori Ogihara (Mitsunori Ogiwara)	[1] [3] [5] [6] [7] [8]
11	Kenneth W. Regan	[2] [4]
12	John D. Rogers	[12] [13] [17]
13	James S. Royer	[13]
14	Alan L. Selman	[1] [3] [5] [6] [7] [8] [11] [13] [16]
15	D. Sivakumar	[2] [4] [9]
16	Thomas Thierauf	[5]
17	Jie Wang	[5]