Author of the publication

Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints.

, , , and . ICML, volume 202 of Proceedings of Machine Learning Research, page 18563-18583. PMLR, (2023)

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

Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty., , , , , and . ESA, volume 204 of LIPIcs, page 10:1-10:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Untrusted Predictions Improve Trustable Query Policies., , , , and . CoRR, (2020)Throughput scheduling with equal additive laxity., , and . Oper. Res. Lett., 50 (5): 463-469 (2022)Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints., , , and . ICML, volume 202 of Proceedings of Machine Learning Research, page 18563-18583. PMLR, (2023)Sorting and Hypergraph Orientation under Uncertainty with Predictions., , , and . IJCAI, page 5577-5585. ijcai.org, (2023)On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems., , , , and . IPDPS, page 1061-1070. IEEE, (2020)Santa Claus meets Makespan and Matroids: Algorithms and Reductions., , , , and . SODA, page 2829-2860. SIAM, (2024)Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques., and . IPCO, volume 13904 of Lecture Notes in Computer Science, page 319-333. Springer, (2023)Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty., , , and . ESA, volume 244 of LIPIcs, page 49:1-49:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Robustification of Online Graph Exploration Methods., , , , and . AAAI, page 9732-9740. AAAI Press, (2022)