Author of the publication

Analysis and approximation of optimal co-scheduling on chip multiprocessors.

, , , and . PACT, page 220-229. ACM, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Identifying high betweenness centrality nodes in large social networks., , , , and . CoRR, (2017)Detecting Sensitive Content in Spoken Language., , , and . DSAA, page 374-381. IEEE, (2019)On strategy improvement algorithms for simple stochastic games., , and . J. Discrete Algorithms, 9 (3): 263-278 (2011)Complexity Results in Graph Reconstruction., , , and . MFCS, volume 3153 of Lecture Notes in Computer Science, page 287-297. Springer, (2004)On Strategy Improvement Algorithms for Simple Stochastic Games., , and . CIAC, volume 6078 of Lecture Notes in Computer Science, page 240-251. Springer, (2010)Estimating Precisions for Multiple Binary Classifiers Under Limited Samples., , and . ECML/PKDD (4), volume 12460 of Lecture Notes in Computer Science, page 240-256. Springer, (2020)The 1-Versus-2 Queries Problem Revisited.. ISAAC, volume 4835 of Lecture Notes in Computer Science, page 137-147. Springer, (2007)Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument.. MFCS, volume 4708 of Lecture Notes in Computer Science, page 548-558. Springer, (2007)Analysis and approximation of optimal co-scheduling on chip multiprocessors., , , and . PACT, page 220-229. ACM, (2008)Mining Associations Using Directed Hypergraphs., , and . ICDE Workshops, page 190-197. IEEE Computer Society, (2012)