Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Tripathi, Rahul - Department of Computer Science and Engineering, University of South Florida
Linear Connectivity Problems in Directed Hypergraphs Mayur Thakur
On the Power of Unambiguity in Alternating Machines Holger Spakowski
LWPP and WPP are not uniformly gap-definable Holger Spakowski
The 1-Versus-2 Queries Problem Revisited Rahul Tripathi
Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational
Hierarchical Unambiguity Holger Spakowski1
On the Power of Unambiguity in Alternating Holger Spakowski1
On Strategy Improvement Algorithms for Simple Stochastic Rahul Tripathia,
SIAM J. COMPUT. c 2009 Society for Industrial and Applied Mathematics Vol. 38, No. 5, pp. 20792112
Analysis and Approximation of Optimal Co-Scheduling on Chip Multiprocessors
The Complexity of Optimal Job Co-Scheduling on Chip Multiprocessors and Heuristics-Based
On the Computational Power of Locally Random Reductions Rahul Tripathi
Complexity Results in Graph Reconstruction Edith Hemaspaandra
The 1-Versus-2 Queries Problem Revisited Rahul Tripathi
On Strategy Improvement Algorithms for Simple Stochastic Games
DEGREE BOUNDS ON POLYNOMIALS AND RELATIVIZATION THEORY
