( en | de | ru )

 

Disambiguation of "Ebenlendr, Tomás"

Author of the publication

copydeleteadd this publication to your clipboard
Semi-Online Preemptive Scheduling: One Algorithm for All Variants.

, and . Theory Comput. Syst., 48 (3): 577-613 (2011)

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.

Tomás Núñez

Tomás Vinar

Ana Teresa Monteiro Tomás

Tomás Barros

Tomás Mácha

 

Other publications of authors with the same name

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