1 citations · 1 across the 5 of their papers we have counts for
3 papers · 1 filter
Online Graph Algorithms with Predictions
Yossi Azar, Debmalya Panigrahi, Noam Touitou
Online algorithms with predictions is a popular and elegant framework for bypassing pessimistic lower bounds in competitive analysis. In this model, online algorithms are supplied…
Distortion-Oblivious Algorithms for Minimizing Flow Time
Yossi Azar, Stefano Leonardi, Noam Touitou
We consider the classic online problem of scheduling on a single machine to minimize total flow time. In STOC 2021, the concept of robustness to distortion in processing times was…
Flow Time Scheduling with Uncertain Processing Time
Yossi Azar, Stefano Leonardi, Noam Touitou
We consider the problem of online scheduling on a single machine in order to minimize weighted flow time. The existing algorithms for this problem (STOC '01, SODA '03, FOCS '18) al…