Author of the publication

Online Scheduling of Bounded Length Jobs to Maximize Throughput.

, , and . WAOA, volume 5893 of Lecture Notes in Computer Science, page 116-127. 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. 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

Randomized Algorithm for Agreeable Deadlines Packet Scheduling.. STACS, volume 5 of LIPIcs, page 489-500. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Lower bounds for online makespan minimization on a small number of related machines., , , and . J. Sched., 16 (5): 539-547 (2013)Mechanism Design for Aggregating Energy Consumption and Quality of Service in Speed Scaling Scheduling., , and . WINE, volume 8289 of Lecture Notes in Computer Science, page 134-145. Springer, (2013)Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems., , , and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 101-113. Springer, (2022)Pricing Online Decisions: Beyond Auctions., , , and . SODA, page 73-91. SIAM, (2015)Better Bounds for Online Line Chasing., , , , , and . CoRR, (2018)Unbounded lower bound for k-server against weak adversaries., , , and . STOC, page 1165-1169. ACM, (2020)Online Scheduling of Jobs with Fixed Start Times on Related Machines., , , and . APPROX-RANDOM, volume 7408 of Lecture Notes in Computer Science, page 134-145. Springer, (2012)Online Disjoint Set Covers: Randomization is not Necessary., , and . CoRR, (2024)Dynamic Pricing of Servers on Trees., , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 10:1-10:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)