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