Aduri Pavan

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2012
j24		Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran: On the power of unambiguity in log-space. Computational Complexity 21(4): 643-670 (2012)
j23		Xiaoyang Gu, John M. Hitchcock, Aduri Pavan: Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses. Theory Comput. Syst. 51(2): 248-265 (2012)
c23		Andrew Hughes, Aduri Pavan, Nathan Russell, Alan L. Selman: A Thirty Year Old Conjecture about Promise Problems. ICALP (1) 2012: 473-484
	2011
j22		Christian Glaßer, Aduri Pavan, Stephen D. Travers: The fault tolerance of NP-hard problems. Inf. Comput. 209(3): 443-455 (2011)
j21		Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang: Extracting Kolmogorov complexity with applications to dimension zero-one laws. Inf. Comput. 209(4): 627-636 (2011)
j20		John M. Hitchcock, Aduri Pavan, N. Variyam Vinodchandran: Kolmogorov Complexity in Randomness Extraction. TOCT 3(1): 1 (2011)
c22		Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers: Unions of Disjoint NP-Complete Sets. COCOON 2011: 240-251
	2010
c21		Xiaoyang Gu, John M. Hitchcock, Aduri Pavan: Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses. STACS 2010: 429-440
i15		Xiaoyang Gu, John M. Hitchcock, Aduri Pavan: Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses. CoRR abs/1001.0117 (2010)
i14		Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran: On the Power of Unambiguity in Logspace. CoRR abs/1001.2034 (2010)
i13		Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran: On the Power of Unambiguity in Logspace. Electronic Colloquium on Computational Complexity (ECCC) 17: 9 (2010)
	2009
c20		John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran: Kolmogorov Complexity in Randomness Extraction. FSTTCS 2009: 215-226
c19		Christian Glaßer, Aduri Pavan, Stephen D. Travers: The Fault Tolerance of NP-Hard Problems. LATA 2009: 374-385
i12		John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran: Kolmogorov Complexity in Randomness Extraction. Electronic Colloquium on Computational Complexity (ECCC) 16: 71 (2009)
	2008
j19		John M. Hitchcock, Aduri Pavan: Hardness Hypotheses, Derandomization, and Circuit Complexity. Computational Complexity 17(1): 119-146 (2008)
j18		Aduri Pavan, N. V. Vinodchandran: 2-Local Random Reductions to 3-Valued Functions. Computational Complexity 17(4): 501-514 (2008)
j17		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)
j16		John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran: Partial Bi-immunity, Scaled Dimension, and NP-Completeness. Theory Comput. Syst. 42(2): 131-142 (2008)
j15		Aduri Pavan, N. V. Vinodchandran: Relations between Average-Case and Worst-Case Complexity. Theory Comput. Syst. 42(4): 596-607 (2008)
j14		Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang: Splitting NP-Complete Sets. SIAM J. Comput. 37(5): 1517-1535 (2008)
	2007
j13		John M. Hitchcock, Aduri Pavan: Comparing reductions to NP-complete sets. Inf. Comput. 205(5): 694-706 (2007)
j12		Aduri Pavan, Fengming Wang: Robustness of PSPACE-complete sets. Inf. Process. Lett. 103(3): 102-104 (2007)
j11		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)
j10		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)
c18		Ryan C. Harkins, John M. Hitchcock, Aduri Pavan: Strong Reductions and Isomorphism of Complete Sets. FSTTCS 2007: 168-178
	2006
j9		Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta: Properties of NP-Complete Sets. SIAM J. Comput. 36(2): 516-542 (2006)
c17		Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran: Some Results on Average-Case Hardness Within the Polynomial Hierarchy. FSTTCS 2006: 188-199
c16		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
c15		John M. Hitchcock, Aduri Pavan: Comparing Reductions to NP-Complete Sets. ICALP (1) 2006: 465-476
c14		Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang: Redundancy in Complete Sets. STACS 2006: 444-454
c13		Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang: Mitosis in Computational Complexity. TAMC 2006: 61-67
i11		John M. Hitchcock, Aduri Pavan: Comparing Reductions to NP-Complete Sets. Electronic Colloquium on Computational Complexity (ECCC) 13(039) (2006)
i10		John M. Hitchcock, Aduri Pavan: Hardness Hypotheses, Derandomization, and Circuit Complexity. Electronic Colloquium on Computational Complexity (ECCC) 13(071) (2006)
	2005
j8		John M. Hitchcock, Aduri Pavan: Resource-bounded strong dimension versus resource-bounded category. Inf. Process. Lett. 95(3): 377-381 (2005)
j7		Harry Buhrman, Lance Fortnow, Aduri Pavan: Some Results on Derandomization. Theory Comput. Syst. 38(2): 211-227 (2005)
c12		Aduri Pavan, N. V. Vinodchandran: Relations Between Average-Case and Worst-Case Complexity. FCT 2005: 422-432
c11		Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang: Autoreducibility, Mitoticity, and Immunity. MFCS 2005: 387-398
i9		Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang: Autoreducibility, Mitoticity, and Immunity. Electronic Colloquium on Computational Complexity (ECCC)(011) (2005)
i8		Aduri Pavan, N. V. Vinodchandran: 2-Local Random Reductions to 3-Valued Functions. Electronic Colloquium on Computational Complexity (ECCC)(062) (2005)
i7		Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang: Redundancy in Complete Sets. Electronic Colloquium on Computational Complexity (ECCC)(068) (2005)
i6		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)
	2004
j6		Aduri Pavan, Alan L. Selman: Bi-immunity separates strong NP-completeness notions. Inf. Comput. 188(1): 116-126 (2004)
j5		Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta: On Higher Arthur-Merlin Classes. Int. J. Found. Comput. Sci. 15(1): 3-19 (2004)
c10		Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta: Properties of NP-Complete Sets. IEEE Conference on Computational Complexity 2004: 184-197
c9		John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran: Partial Bi-immunity and NP-Completeness. IEEE Conference on Computational Complexity 2004: 198-203
c8		John M. Hitchcock, Aduri Pavan: Hardness Hypotheses, Derandomization, and Circuit Complexity. FSTTCS 2004: 336-347
i5		Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta: Properties of NP-Complete Sets. Electronic Colloquium on Computational Complexity (ECCC)(019) (2004)
i4		John M. Hitchcock, Aduri Pavan, Pramodchandran N. Variyam: Partial Bi-Immunity and NP-Completeness. Electronic Colloquium on Computational Complexity (ECCC)(025) (2004)
i3		Aduri Pavan, N. V. Vinodchandran: Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility. Electronic Colloquium on Computational Complexity (ECCC)(053) (2004)
	2003
c7		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-
c6		Harry Buhrman, Lance Fortnow, Aduri Pavan: Some Results on Derandomization. STACS 2003: 212-222
	2002
c5		Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta: On Higher Arthur-Merlin Classes. COCOON 2002: 18-27
c4		Aduri Pavan, Alan L. Selman: Bi-Immunity Separates Strong NP-Completeness Notions. STACS 2002: 408-418
i2		Aduri Pavan, Alan L. Selman: Bi-Immunity Separates Strong NP-Completeness Notions. Electronic Colloquium on Computational Complexity (ECCC)(005) (2002)
	2001
j4		Lance Fortnow, Aduri Pavan, Alan L. Selman: Distributionally Hard Languages. Theory Comput. Syst. 34(3): 245-261 (2001)
j3		Aduri Pavan, Alan L. Selman: Separation of NP-Completeness Notions. SIAM J. Comput. 31(3): 906-918 (2001)
c3		Aduri Pavan, Alan L. Selman: Separation of NP-Completeness Notions. IEEE Conference on Computational Complexity 2001: 78-89
i1		Aduri Pavan, Alan L. Selman: Separation of NP-completeness Notions. Electronic Colloquium on Computational Complexity (ECCC) 8(32) (2001)
	2000
j2		Aduri Pavan, Alan L. Selman: Complete distributional problems, hard languages, and resource-bounded measure. Theor. Comput. Sci. 234(1-2): 273-286 (2000)
	1999
j1		Jay Belanger, Aduri Pavan, Jie Wang: Reductions Do Not Preserve Fast Convergence Rates in Average Time. Algorithmica 23(4): 363-373 (1999)
c2		Lance Fortnow, Aduri Pavan, Alan L. Selman: Distributionally-Hard Languages. COCOON 1999: 184-193
c1		Jin-yi Cai, Aduri Pavan, D. Sivakumar: On the Hardness of Permanent. STACS 1999: 90-99

Coauthor Index

1	Jay Belanger	[j1]
2	Harry Buhrman	[j7] [c6]
3	Jin-Yi Cai (Jin-yi Cai)	[j5] [c5] [c1]
4	Denis Charles	[j5] [c5]
5	Lance Fortnow	[j21] [j17] [c16] [j7] [i6] [c7] [c6] [j4] [c2]
6	Christian Glaßer (Christian Glasser)	[j22] [c22] [c19] [j14] [j11] [j9] [c14] [c13] [c11] [i9] [i7] [c10] [i5]
7	Xiaoyang Gu	[j23] [c21] [i15]
8	Ryan C. Harkins	[c18]
9	John M. Hitchcock	[j23] [j21] [j20] [c22] [c21] [i15] [c20] [i12] [j19] [j16] [j13] [c18] [c16] [c15] [i11] [i10] [j8] [i6] [c9] [c8] [i4]
10	Andrew Hughes	[c23]
11	Mitsunori Ogihara (Mitsunori Ogiwara)	[j11] [c11] [i9]
12	Nathan Russell	[c23]
13	Rahul Santhanam	[c17]
14	Alan L. Selman	[c23] [j14] [j11] [j10] [j9] [c14] [c13] [c11] [i9] [i7] [j6] [c10] [i5] [c4] [i2] [j4] [j3] [c3] [i1] [j2] [c2]
15	Samik Sengupta	[j17] [j10] [j9] [j5] [c10] [i5] [c7] [c5]
16	D. Sivakumar	[c1]
17	Raghunath Tewari	[j24] [i14] [i13]
18	Stephen D. Travers	[j22] [c22] [c19]
19	Pramodchandran N. Variyam	[i4]
20	N. V. Vinodchandran (N. Variyam Vinodchandran)	[j24] [j21] [j20] [i14] [i13] [c20] [i12] [j18] [j16] [j15] [j10] [c17] [c16] [c12] [i8] [i6] [c9] [i3]
21	Fengming Wang	[j21] [j12] [c16] [i6]
22	Jie Wang	[j1]
23	Liyu Zhang	[j14] [j11] [c14] [c13] [c11] [i9] [i7]

Last update Mon May 20 14:31:31 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page