No. |
Title |
Author |
Year |
---|

1 |
Online Learning and Bandits with Queried Hints |
Bhaskara, Aditya et al. |
2023 |

2 |
An Approximation Algorithm for the Matrix Tree Multiplication Problem |
Abo-Khamis, Mahmoud et al. |
2021 |

3 |
Online Two-Dimensional Load Balancing |
Cohen, Ilan et al. |
2020 |

4 |
Matroid Coflow Scheduling |
Im, Sungjin et al. |
2019 |

5 |
Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing |
Im, Sungjin et al. |
2017 |

6 |
A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints |
Im, Sungjin et al. |
2016 |

7 |
Competitive Analysis of Constrained Queueing Systems |
Im, Sungjin et al. |
2016 |

8 |
Stochastic Scheduling of Heavy-tailed Jobs |
Im, Sungjin et al. |
2015 |

9 |
Preemptive and Non-Preemptive Generalized Min Sum Set Cover |
Im, Sungjin et al. |
2012 |