 | 2009 |
|---|
| 17 |       | Holger Spakowski,
Rahul Tripathi:
Hierarchical Unambiguity.
SIAM J. Comput. 38(5): 2079-2112 (2009) |
| 16 | | Mayur Thakur,
Rahul Tripathi:
Linear connectivity problems in directed hypergraphs.
Theor. Comput. Sci. 410(27-29): 2592-2618 (2009) |
| 2008 |
|---|
| 15 | | Yunlian Jiang,
Xipeng Shen,
Jie Chen,
Rahul Tripathi:
Analysis and approximation of optimal co-scheduling on chip multiprocessors.
PACT 2008: 220-229 |
| 2007 |
|---|
| 14 | | Rahul Tripathi:
The 1-Versus-2 Queries Problem Revisited.
ISAAC 2007: 137-147 |
| 13 | | Rahul Tripathi:
Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument.
MFCS 2007: 548-558 |
| 12 | | Holger Spakowski,
Rahul Tripathi:
Hierarchical Unambiguity
CoRR abs/cs/0702047: (2007) |
| 11 | | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Stanislaw P. Radziszowski,
Rahul Tripathi:
Complexity results in graph reconstruction.
Discrete Applied Mathematics 155(2): 103-118 (2007) |
| 10 | | Holger Spakowski,
Rahul Tripathi:
On the Power of Unambiguity in Alternating Machines.
Theory Comput. Syst. 41(2): 291-326 (2007) |
| 2006 |
|---|
| 9 | | Holger Spakowski,
Rahul Tripathi:
Hierarchical Unambiguity.
MFCS 2006: 777-788 |
| 8 | | Holger Spakowski,
Rahul Tripathi:
LWPP and WPP are not uniformly gap-definable.
J. Comput. Syst. Sci. 72(4): 660-689 (2006) |
| 2005 |
|---|
| 7 | | Holger Spakowski,
Rahul Tripathi:
On the Power of Unambiguity in Alternating Machines.
FCT 2005: 125-136 |
| 6 | | Holger Spakowski,
Mayur Thakur,
Rahul Tripathi:
Quantum and classical complexity classes: Separations, collapses, and closure properties.
Inf. Comput. 200(1): 1-34 (2005) |
| 2004 |
|---|
| 5 | | Mayur Thakur,
Rahul Tripathi:
Complexity of Linear Connectivity Problems in Directed Hypergraphs.
FSTTCS 2004: 481-493 |
| 4 |  | Holger Spakowski,
Rahul Tripathi:
Degree Bounds on Polynomials and Relativization Theory.
IFIP TCS 2004: 97-110 |
| 3 | | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Stanislaw P. Radziszowski,
Rahul Tripathi:
Complexity Results in Graph Reconstruction.
MFCS 2004: 287-297 |
| 2 | | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Stanislaw P. Radziszowski,
Rahul Tripathi:
Complexity Results in Graph Reconstruction
CoRR cs.CC/0410021: (2004) |
| 2003 |
|---|
| 1 | | Holger Spakowski,
Mayur Thakur,
Rahul Tripathi:
Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties.
FSTTCS 2003: 375-386 |
