|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 6 occurrences of 4 keywords
|
|
|
|
|
Results
Found 21 publication records. Showing 21 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Yunlian Jiang, Kai Tian, Xipeng Shen, Jinghe Zhang, Jie Chen 0010, Rahul Tripathi |
The Complexity of Optimal Job Co-Scheduling on Chip Multiprocessors and Heuristics-Based Solutions.  |
IEEE Trans. Parallel Distrib. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
CMP scheduling, cache contention, integer programming, perfect matching, shared cache, Co-scheduling |
| 1 | Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar |
On strategy improvement algorithms for simple stochastic games. |
J. Discrete Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Tripathi |
The 1-Versus-2 Queries Problem Revisited. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar |
On Strategy Improvement Algorithms for Simple Stochastic Games. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mayur Thakur, Rahul Tripathi |
Linear connectivity problems in directed hypergraphs. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Spakowski, Rahul Tripathi |
Hierarchical Unambiguity. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yunlian Jiang, Xipeng Shen, Jie Chen 0010, Rahul Tripathi |
Analysis and approximation of optimal co-scheduling on chip multiprocessors. |
PACT |
2008 |
DBLP DOI BibTeX RDF |
CMP scheduling, cache contention, perfect matching, co-scheduling |
| 1 | Holger Spakowski, Rahul Tripathi |
Hierarchical Unambiguity |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Holger Spakowski, Rahul Tripathi |
On the Power of Unambiguity in Alternating Machines. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi |
Complexity results in graph reconstruction. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Tripathi |
Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Tripathi |
The 1-Versus-2 Queries Problem Revisited. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Spakowski, Rahul Tripathi |
LWPP and WPP are not uniformly gap-definable. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Spakowski, Rahul Tripathi |
Hierarchical Unambiguity. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Spakowski, Mayur Thakur, Rahul Tripathi |
Quantum and classical complexity classes: Separations, collapses, and closure properties. |
Inf. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Spakowski, Rahul Tripathi |
On the Power of Unambiguity in Alternating Machines. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi |
Complexity Results in Graph Reconstruction |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi |
Complexity Results in Graph Reconstruction. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Spakowski, Rahul Tripathi |
Degree Bounds on Polynomials and Relativization Theory. |
IFIP TCS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Mayur Thakur, Rahul Tripathi |
Complexity of Linear Connectivity Problems in Directed Hypergraphs. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Spakowski, Mayur Thakur, Rahul Tripathi |
Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #21 of 21 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")