( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput.

, , и . PPAM (2), том 6068 из Lecture Notes in Computer Science, стр. 52-61. Springer, (2009)

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.

Tomás Núñez

Tomás Vinar

Ana Teresa Monteiro Tomás

Tomás Barros

Tomás Mácha

 

Другие публикации лиц с тем же именем

Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput., , и . PPAM (2), том 6068 из Lecture Notes in Computer Science, стр. 52-61. Springer, (2009)A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines., и . WAOA, том 5426 из Lecture Notes in Computer Science, стр. 43-52. Springer, (2008)Graph balancing: a special case of scheduling unrelated parallel machines., , и . SODA, стр. 483-490. SIAM, (2008)Optimal and Online Preemptive Scheduling on Uniformly Related Machines., и . STACS, том 2996 из Lecture Notes in Computer Science, стр. 199-210. Springer, (2004)Online Scheduling of Equal-Length Jobs on Parallel Machines., , , и . ESA, том 4698 из Lecture Notes in Computer Science, стр. 427-438. Springer, (2007)A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption., и . Theory Comput. Syst., 56 (1): 73-81 (2015)Semi-Online Preemptive Scheduling: One Algorithm for All Variants., и . Theory Comput. Syst., 48 (3): 577-613 (2011)Semi-online Preemptive Scheduling: Study of Special Cases.. PPAM (2), том 6068 из Lecture Notes in Computer Science, стр. 11-20. Springer, (2009)Semi-Online Preemptive Scheduling: One Algorithm for All Variants., и . STACS, том 3 из LIPIcs, стр. 349-360. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)Graph balancing: a special case of scheduling unrelated parallel machines, , и . SODA, стр. 483-490. SIAM, (2008)