| Publication | Date of Publication | Type |
|---|
| Controlling tail risk in online ski-rental | 2024-11-28 | Paper |
| Online learning and bandits with queried hints | 2024-09-25 | Paper |
| Improved approximations for unrelated machine scheduling | 2024-05-14 | Paper |
| An approximation algorithm for the matrix tree multiplication problem | 2023-08-08 | Paper |
| Matroid coflow scheduling | 2022-07-21 | Paper |
The matroid cup game
Operations Research Letters | 2021-12-13 | Paper |
The matroid intersection cover problem
Operations Research Letters | 2021-04-07 | Paper |
Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Breaking \(1-1/e\) barrier for nonpreemptive throughput maximization
SIAM Journal on Discrete Mathematics | 2020-10-28 | Paper |
Fair scheduling via iterative quasi-uniform sampling
SIAM Journal on Computing | 2020-08-03 | Paper |
| Minimizing maximum flow time on related machines via dynamic posted pricing | 2020-05-27 | Paper |
Hallucination helps: energy efficient virtual circuit routing
SIAM Journal on Computing | 2020-01-21 | Paper |
Online load balancing on related machines
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Non-clairvoyantly scheduling to minimize convex functions
Algorithmica | 2019-08-20 | Paper |
Hallucination helps: energy efficient virtual circuit routing
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
New Approximations for Reordering Buffer Management
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Energy Efficient Scheduling of Parallelizable Jobs
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Online scheduling with general cost functions | 2019-05-10 | Paper |
| Scheduling heterogeneous processors isn't as easy as you think | 2019-05-10 | Paper |
Tight bounds for online vector scheduling
SIAM Journal on Computing | 2019-02-08 | Paper |
Minimizing the maximum flow time in batch scheduling
Operations Research Letters | 2019-01-15 | Paper |
Minimum latency submodular cover
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Competitive algorithms from competitive equilibria, non-clairvoyant scheduling under polyhedral constraints
Journal of the ACM | 2018-08-02 | Paper |
Fair scheduling via iterative quasi-uniform sampling
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| scientific article; zbMATH DE number 6861895 (Why is no real title available?) | 2018-04-19 | Paper |
Energy efficient scheduling of parallelizable jobs
Theoretical Computer Science | 2018-04-16 | Paper |
| Competitive analysis of constrained queueing systems | 2017-12-19 | Paper |
New approximations for broadcast scheduling via variants of \(\alpha\)-point rounding
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
A dynamic programming framework for non-preemptive scheduling problems on multiple machines
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| An online scalable algorithm for minimizing \(\ell_k\)-norms of weighted flow time on unrelated machines | 2017-09-29 | Paper |
| Online scalable scheduling for the \(\ell_k\)-norms of flow time without conservation of work | 2017-09-29 | Paper |
| Breaking \(1-1/e\) barrier for non-preemptive throughput maximization | 2017-08-31 | Paper |
Efficient massively parallel methods for dynamic programming
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Coordination mechanisms from (almost) all scheduling policies
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
| scientific article; zbMATH DE number 6677416 (Why is no real title available?) | 2017-01-24 | Paper |
On the randomized competitive ratio of reordering buffer management with non-uniform costs
Automata, Languages, and Programming | 2015-10-27 | Paper |
Weighted reordering buffer improved via variants of knapsack covering inequalities
Automata, Languages, and Programming | 2015-10-27 | Paper |
Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
An online scalable algorithm for average flow time in broadcast scheduling
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Preemptive and non-preemptive generalized min sum set cover
Mathematical Programming. Series A. Series B | 2014-06-27 | Paper |
Online scheduling with general cost functions
SIAM Journal on Computing | 2014-06-04 | Paper |
| An online scalable algorithm for average flow time in broadcast scheduling | 2014-05-22 | Paper |
Online non-clairvoyant scheduling to simultaneously minimize all convex functions
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Minimum latency submodular cover
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Shortest-elapsed-time-first on a multiprocessor
Lecture Notes in Computer Science | 2013-04-19 | Paper |
Online scheduling to minimize maximum response time and maximum delay factor
Theory of Computing | 2012-09-27 | Paper |
| Preemptive and non-preemptive generalized min sum set cover | 2012-08-23 | Paper |
Speed scaling for stretch plus energy
Operations Research Letters | 2012-08-17 | Paper |
New models and algorithms for throughput maximization in broadcast scheduling (extended abstract)
Approximation and Online Algorithms | 2011-02-15 | Paper |
Longest wait first for broadcast scheduling (extended abstract)
Approximation and Online Algorithms | 2010-05-11 | Paper |
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
Lecture Notes in Computer Science | 2009-10-29 | Paper |
