From post

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.

 

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

Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics., , и . ISAAC, том 149 из LIPIcs, стр. 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Scheduling multipacket frames with frame deadlines., , и . J. Sched., 20 (6): 623-634 (2017)A Universal Randomized Packet Scheduling Algorithm.. Algorithmica, 67 (4): 498-515 (2013)A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue., , , , , , и . Theor. Comput. Sci., (2013)Tight Bounds for Double Coverage Against Weak Adversaries., , , , и . Theory Comput. Syst., 62 (2): 349-365 (2018)Online Scheduling of Bounded Length Jobs to Maximize Throughput., , и . WAOA, том 5893 из Lecture Notes in Computer Science, стр. 116-127. Springer, (2009)Tight Bounds for Double Coverage Against Weak Adversaries., , , , и . WAOA, том 9499 из Lecture Notes in Computer Science, стр. 47-58. Springer, (2015)Lower bounds for online makespan minimization on a small number of related machines., , , и . J. Sched., 16 (5): 539-547 (2013)Online Scheduling of Jobs with Fixed Start Times on Related Machines., , , и . Algorithmica, 74 (1): 156-176 (2016)Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption., , и . CoRR, (2018)