Rahul Santhanam

	2009
23		Harry Buhrman, Lance Fortnow, Rahul Santhanam: Unconditional Lower Bounds against Advice. ICALP (1) 2009: 195-209
22		Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr: Branching Programs for Tree Evaluation. MFCS 2009: 175-186
	2008
21		Lance Fortnow, Rahul Santhanam: Infeasibility of instance compression and succinct PCPs for NP. STOC 2008: 133-142
	2007
20		Rahul Santhanam: Circuit lower bounds for Merlin-Arthur classes. STOC 2007: 275-283
19		Lance Fortnow, Rahul Santhanam: Time Hierarchies: A Survey. Electronic Colloquium on Computational Complexity (ECCC) 14(004): (2007)
18		Rahul Santhanam: Circuit Lower Bounds for Merlin-Arthur Classes. Electronic Colloquium on Computational Complexity (ECCC) 14(005): (2007)
17		Lance Fortnow, Rahul Santhanam: Infeasibility of Instance Compression and Succinct PCPs for NP. Electronic Colloquium on Computational Complexity (ECCC) 14(096): (2007)
	2006
16		Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran: Some Results on Average-Case Hardness Within the Polynomial Hierarchy. FSTTCS 2006: 188-199
15		Ivona Bezáková, Adam Kalai, Rahul Santhanam: Graph model selection using maximum likelihood. ICML 2006: 105-112
14		Joshua Buresh-Oppenheim, Rahul Santhanam: Making Hard Problems Harder. IEEE Conference on Computational Complexity 2006: 73-87
13		Rahul Santhanam, Kamala Krithivasan: Graph splicing systems. Discrete Applied Mathematics 154(8): 1264-1278 (2006)
12		Joshua Buresh-Oppenheim, Rahul Santhanam: Making Hard Problems Harder Electronic Colloquium on Computational Complexity (ECCC)(003): (2006)
11		Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul Santhanam: Uniform Hardness Amplification in NP via Monotone Codes. Electronic Colloquium on Computational Complexity (ECCC) 13(154): (2006)
10		Lance Fortnow, Rahul Santhanam: Fixed-Polynomial Size Circuit Bounds. Electronic Colloquium on Computational Complexity (ECCC) 13(157): (2006)
	2005
9		Lance Fortnow, Rahul Santhanam, Luca Trevisan: Hierarchies for semantic classes. STOC 2005: 348-355
8		Dieter van Melkebeek, Rahul Santhanam: Holographic Proofs and Derandmization. SIAM J. Comput. 35(1): 59-90 (2005)
	2004
7		Lance Fortnow, Rahul Santhanam: Hierarchy Theorems for Probabilistic Polynomial Time. FOCS 2004: 316-324
6		Lance Fortnow, Rahul Santhanam, Luca Trevisan: Promise Hierarchies Electronic Colloquium on Computational Complexity (ECCC)(098): (2004)
	2003
5		Rahul Santhanam, Dieter van Melkebeek: Holographic Proofs and Derandomization. IEEE Conference on Computational Complexity 2003: 269-283
	2002
4		Rahul Santhanam: Resource Tradeoffs and Derandomization Electronic Colloquium on Computational Complexity (ECCC)(038): (2002)
	2001
3		Rahul Santhanam: On Separators, Segregators and Time versus Space. IEEE Conference on Computational Complexity 2001: 286-294
2		Rahul Santhanam: On segregators, separators and time versus space Electronic Colloquium on Computational Complexity (ECCC) 8(22): (2001)
1		Rahul Santhanam: Lower bounds on the complexity of recognizing SAT by Turing machines. Inf. Process. Lett. 79(5): 243-247 (2001)

Coauthor Index

1	Ivona Bezáková	[15]
2	Mark Braverman	[22]
3	Harry Buhrman	[23]
4	Joshua Buresh-Oppenheim (Josh Buresh-Oppenheim)	[11] [12] [14]
5	Stephen A. Cook	[22]
6	Lance Fortnow	[6] [7] [9] [10] [17] [19] [21] [23]
7	Valentine Kabanets	[11]
8	Adam Tauman Kalai (Adam Kalai)	[15]
9	Kamala Krithivasan	[13]
10	Pierre McKenzie	[22]
11	Dieter van Melkebeek	[5] [8]
12	Aduri Pavan	[16]
13	Luca Trevisan	[6] [9]
14	N. V. Vinodchandran (N. Variyam Vinodchandran)	[16]
15	Dustin Wehr	[22]

Colors in the list of coauthors