Author of the publication

Better Bounds for Online Line Chasing.

, , , , , and . MFCS, volume 138 of LIPIcs, page 8:1-8:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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

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