Author of the publication

Scheduling Parallelizable Jobs Online to Minimize the Maximum Flow Time.

, , , and . SPAA, page 195-205. ACM, (2016)

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 jobs with varying parallelizability to reduce variance., , , , and . SPAA, page 11-20. ACM, (2010)The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract)., , and . IPCO, volume 7801 of Lecture Notes in Computer Science, page 278-289. Springer, (2013)Minimizing Completion Times for Stochastic Jobs via Batched Free Times., , and . SODA, page 1905-1930. SIAM, (2023)An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling., and . SODA, page 1322-1333. SIAM, (2010)Controlling Tail Risk in Online Ski-Rental., , , , and . SODA, page 4247-4263. SIAM, (2024)Scheduling heterogeneous processors isn't as easy as you think., , , , and . SODA, page 1242-1253. SIAM, (2012)A Scalable Approximation Algorithm for Weighted Longest Common Subsequence., , , and . Euro-Par, volume 12820 of Lecture Notes in Computer Science, page 368-384. Springer, (2021)Efficient Nonmyopic Active Search., , , , , and . ICML, volume 70 of Proceedings of Machine Learning Research, page 1714-1723. PMLR, (2017)Cooperative Set Function Optimization Without Communication or Coordination., , , , , and . AAMAS, page 1109-1118. ACM, (2017)Online Scheduling with General Cost Functions., , and . SIAM J. Comput., 43 (1): 126-143 (2014)