Rahul Tripathi

Ramanuja Simha, Rahul Tripathi, Mayur Thakur: Mining Associations Using Directed Hypergraphs. ICDE Workshops 2012: 190-197

Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar: On strategy improvement algorithms for simple stochastic games. J. Discrete Algorithms 9(3): 263-278 (2011)

Yunlian Jiang, Kai Tian, Xipeng Shen, Jinghe Zhang, Jie Chen, Rahul Tripathi: The Complexity of Optimal Job Co-Scheduling on Chip Multiprocessors and Heuristics-Based Solutions. IEEE Trans. Parallel Distrib. Syst. 22(7): 1192-1205 (2011)

Tharaka Alahakoon, Rahul Tripathi, Nicolas Kourtellis, Ramanuja Simha, Adriana Iamnitchi: K-path centrality: a new centrality measure in social networks. SNS 2011: 1

Rahul Tripathi: The 1-Versus-2 Queries Problem Revisited. Theory Comput. Syst. 46(2): 193-221 (2010)

Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar: On Strategy Improvement Algorithms for Simple Stochastic Games. CIAC 2010: 240-251

Holger Spakowski, Rahul Tripathi: Hierarchical Unambiguity. SIAM J. Comput. 38(5): 2079-2112 (2009)

Mayur Thakur, Rahul Tripathi: Linear connectivity problems in directed hypergraphs. Theor. Comput. Sci. 410(27-29): 2592-2618 (2009)

Yunlian Jiang, Xipeng Shen, Jie Chen, Rahul Tripathi: Analysis and approximation of optimal co-scheduling on chip multiprocessors. PACT 2008: 220-229

Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi: Complexity results in graph reconstruction. Discrete Applied Mathematics 155(2): 103-118 (2007)

Holger Spakowski, Rahul Tripathi: On the Power of Unambiguity in Alternating Machines. Theory Comput. Syst. 41(2): 291-326 (2007)

Rahul Tripathi: The 1-Versus-2 Queries Problem Revisited. ISAAC 2007: 137-147

Rahul Tripathi: Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument. MFCS 2007: 548-558

Holger Spakowski, Rahul Tripathi: Hierarchical Unambiguity. CoRR abs/cs/0702047 (2007)

Holger Spakowski, Rahul Tripathi: LWPP and WPP are not uniformly gap-definable. J. Comput. Syst. Sci. 72(4): 660-689 (2006)

Holger Spakowski, Rahul Tripathi: Hierarchical Unambiguity. MFCS 2006: 777-788

Holger Spakowski, Mayur Thakur, Rahul Tripathi: Quantum and classical complexity classes: Separations, collapses, and closure properties. Inf. Comput. 200(1): 1-34 (2005)

Holger Spakowski, Rahul Tripathi: On the Power of Unambiguity in Alternating Machines. FCT 2005: 125-136

Mayur Thakur, Rahul Tripathi: Complexity of Linear Connectivity Problems in Directed Hypergraphs. FSTTCS 2004: 481-493

Holger Spakowski, Rahul Tripathi: Degree Bounds on Polynomials and Relativization Theory. IFIP TCS 2004: 97-110

Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi: Complexity Results in Graph Reconstruction. MFCS 2004: 287-297

Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi: Complexity Results in Graph Reconstruction. CoRR cs.CC/0410021 (2004)

Holger Spakowski, Mayur Thakur, Rahul Tripathi: Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties. FSTTCS 2003: 375-386