Aduri Pavan

	2009
49		Christian Glaßer, Aduri Pavan, Stephen D. Travers: The Fault Tolerance of NP-Hard Problems. LATA 2009: 374-385
	2008
48		John M. Hitchcock, Aduri Pavan: Hardness Hypotheses, Derandomization, and Circuit Complexity. Computational Complexity 17(1): 119-146 (2008)
47		Aduri Pavan, N. V. Vinodchandran: 2-Local Random Reductions to 3-Valued Functions. Computational Complexity 17(4): 501-514 (2008)
46		Lance Fortnow, Aduri Pavan, Samik Sengupta: Proving SAT does not have small circuits with an application to the two queries problem. J. Comput. Syst. Sci. 74(3): 358-363 (2008)
45		Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang: Splitting NP-Complete Sets. SIAM J. Comput. 37(5): 1517-1535 (2008)
44		John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran: Partial Bi-immunity, Scaled Dimension, and NP-Completeness. Theory Comput. Syst. 42(2): 131-142 (2008)
43		Aduri Pavan, N. V. Vinodchandran: Relations between Average-Case and Worst-Case Complexity. Theory Comput. Syst. 42(4): 596-607 (2008)
	2007
42		Ryan C. Harkins, John M. Hitchcock, Aduri Pavan: Strong Reductions and Isomorphism of Complete Sets. FSTTCS 2007: 168-178
41		John M. Hitchcock, Aduri Pavan: Comparing reductions to NP-complete sets. Inf. Comput. 205(5): 694-706 (2007)
40		Aduri Pavan, Fengming Wang: Robustness of PSPACE-complete sets. Inf. Process. Lett. 103(3): 102-104 (2007)
39		Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang: Autoreducibility, mitoticity, and immunity. J. Comput. Syst. Sci. 73(5): 735-754 (2007)
38		Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran: Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. Theor. Comput. Sci. 385(1-3): 167-178 (2007)
	2006
37		Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran: Some Results on Average-Case Hardness Within the Polynomial Hierarchy. FSTTCS 2006: 188-199
36		Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang: Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. ICALP (1) 2006: 335-345
35		John M. Hitchcock, Aduri Pavan: Comparing Reductions to NP-Complete Sets. ICALP (1) 2006: 465-476
34		Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang: Redundancy in Complete Sets. STACS 2006: 444-454
33		Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang: Mitosis in Computational Complexity. TAMC 2006: 61-67
32		John M. Hitchcock, Aduri Pavan: Comparing Reductions to NP-Complete Sets. Electronic Colloquium on Computational Complexity (ECCC) 13(039): (2006)
31		John M. Hitchcock, Aduri Pavan: Hardness Hypotheses, Derandomization, and Circuit Complexity. Electronic Colloquium on Computational Complexity (ECCC) 13(071): (2006)
30		Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta: Properties of NP-Complete Sets. SIAM J. Comput. 36(2): 516-542 (2006)
	2005
29		Aduri Pavan, N. V. Vinodchandran: Relations Between Average-Case and Worst-Case Complexity. FCT 2005: 422-432
28		Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang: Autoreducibility, Mitoticity, and Immunity. MFCS 2005: 387-398
27		Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang: Autoreducibility, Mitoticity, and Immunity Electronic Colloquium on Computational Complexity (ECCC)(011): (2005)
26		Aduri Pavan, N. V. Vinodchandran: 2-Local Random Reductions to 3-Valued Functions Electronic Colloquium on Computational Complexity (ECCC)(062): (2005)
25		Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang: Redundancy in Complete Sets Electronic Colloquium on Computational Complexity (ECCC)(068): (2005)
24		Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang: Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws Electronic Colloquium on Computational Complexity (ECCC)(105): (2005)
23		John M. Hitchcock, Aduri Pavan: Resource-bounded strong dimension versus resource-bounded category. Inf. Process. Lett. 95(3): 377-381 (2005)
22		Harry Buhrman, Lance Fortnow, Aduri Pavan: Some Results on Derandomization. Theory Comput. Syst. 38(2): 211-227 (2005)
	2004
21		John M. Hitchcock, Aduri Pavan: Hardness Hypotheses, Derandomization, and Circuit Complexity. FSTTCS 2004: 336-347
20		Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta: Properties of NP-Complete Sets. IEEE Conference on Computational Complexity 2004: 184-197
19		John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran: Partial Bi-immunity and NP-Completeness. IEEE Conference on Computational Complexity 2004: 198-203
18		Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta: Properties of NP-Complete Sets Electronic Colloquium on Computational Complexity (ECCC)(019): (2004)
17		John M. Hitchcock, Aduri Pavan, Pramodchandran N. Variyam: Partial Bi-Immunity and NP-Completeness Electronic Colloquium on Computational Complexity (ECCC)(025): (2004)
16		Aduri Pavan, N. V. Vinodchandran: Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility Electronic Colloquium on Computational Complexity (ECCC)(053): (2004)
15		Aduri Pavan, Alan L. Selman: Bi-immunity separates strong NP-completeness notions. Inf. Comput. 188(1): 116-126 (2004)
14		Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta: On Higher Arthur-Merlin Classes. Int. J. Found. Comput. Sci. 15(1): 3-19 (2004)
	2003
13		Lance Fortnow, Aduri Pavan, Samik Sengupta: Proving SAT does not have Small Circuits with an Application to the Two. IEEE Conference on Computational Complexity 2003: 347-
12		Harry Buhrman, Lance Fortnow, Aduri Pavan: Some Results on Derandomization. STACS 2003: 212-222
	2002
11		Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta: On Higher Arthur-Merlin Classes. COCOON 2002: 18-27
10		Aduri Pavan, Alan L. Selman: Bi-Immunity Separates Strong NP-Completeness Notions. STACS 2002: 408-418
9		Aduri Pavan, Alan L. Selman: Bi-Immunity Separates Strong NP-Completeness Notions Electronic Colloquium on Computational Complexity (ECCC)(005): (2002)
	2001
8		Aduri Pavan, Alan L. Selman: Separation of NP-Completeness Notions. IEEE Conference on Computational Complexity 2001: 78-89
7		Aduri Pavan, Alan L. Selman: Separation of NP-completeness Notions Electronic Colloquium on Computational Complexity (ECCC) 8(32): (2001)
6		Aduri Pavan, Alan L. Selman: Separation of NP-Completeness Notions. SIAM J. Comput. 31(3): 906-918 (2001)
5		Lance Fortnow, Aduri Pavan, Alan L. Selman: Distributionally Hard Languages. Theory Comput. Syst. 34(3): 245-261 (2001)
	2000
4		Aduri Pavan, Alan L. Selman: Complete distributional problems, hard languages, and resource-bounded measure. Theor. Comput. Sci. 234(1-2): 273-286 (2000)
	1999
3		Lance Fortnow, Aduri Pavan, Alan L. Selman: Distributionally-Hard Languages. COCOON 1999: 184-193
2		Jin-yi Cai, Aduri Pavan, D. Sivakumar: On the Hardness of Permanent. STACS 1999: 90-99
1		Jay Belanger, Aduri Pavan, Jie Wang: Reductions Do Not Preserve Fast Convergence Rates in Average Time. Algorithmica 23(4): 363-373 (1999)

Coauthor Index

1	Jay Belanger	[1]
2	Harry Buhrman	[12] [22]
3	Jin-yi Cai	[2] [11] [14]
4	Denis Charles	[11] [14]
5	Lance Fortnow	[3] [5] [12] [13] [22] [24] [36] [46]
6	Christian Glaßer (Christian Glasser)	[18] [20] [25] [27] [28] [30] [33] [34] [39] [45] [49]
7	Ryan C. Harkins	[42]
8	John M. Hitchcock	[17] [19] [21] [23] [24] [31] [32] [35] [36] [41] [42] [44] [48]
9	Mitsunori Ogihara (Mitsunori Ogiwara)	[27] [28] [39]
10	Rahul Santhanam	[37]
11	Alan L. Selman	[3] [4] [5] [6] [7] [8] [9] [10] [15] [18] [20] [25] [27] [28] [30] [33] [34] [38] [39] [45]
12	Samik Sengupta	[11] [13] [14] [18] [20] [30] [38] [46]
13	D. Sivakumar	[2]
14	Stephen D. Travers	[49]
15	Pramodchandran N. Variyam	[17]
16	N. V. Vinodchandran (N. Variyam Vinodchandran)	[16] [19] [24] [26] [29] [36] [37] [38] [43] [44] [47]
17	Fengming Wang	[24] [36] [40]
18	Jie Wang	[1]
19	Liyu Zhang	[25] [27] [28] [33] [34] [39] [45]