Author of the publication

Lower bounds for online makespan minimization on a small number of related machines.

, , , and . J. Sched., 16 (5): 539-547 (2013)

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

Recurrent Partial Words and Representable Sets., , , , , , and . Journal of Automata, Languages and Combinatorics, 21 (3): 149-181 (2016)Recurrent Partial Words, , , , and . WORDS, volume 63 of EPTCS, page 71-82. (2011)Lower bounds for online makespan minimization on a small number of related machines., , , and . J. Sched., 16 (5): 539-547 (2013)Constructing partial words with subword complexities not achievable by full words., , , , and . Theor. Comput. Sci., (2012)FO Model Checking of Interval Graphs., , , , , and . ICALP (2), volume 7966 of Lecture Notes in Computer Science, page 250-262. Springer, (2013)FO Model Checking of Interval Graphs, , , , , and . Logical Methods in Computer Science, (2015)Binary De Bruijn Partial Words with One Hole., , , and . TAMC, volume 6108 of Lecture Notes in Computer Science, page 128-138. Springer, (2010)