Author of the publication

Nearly-Tight Lower Bounds for Set Cover and Network Design with Deadlines/Delay.

. ISAAC, volume 212 of LIPIcs, page 53:1-53:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

Online Problems with Deadlines, Delay or Predictions. Tel Aviv University, Israel, (2022)Tel Aviv University Library.Distortion-Oblivious Algorithms for Scheduling on Multiple Machines., , and . ISAAC, volume 248 of LIPIcs, page 16:1-16:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Online Graph Algorithms with Predictions., , and . SODA, page 35-66. SIAM, (2022)Frameworks for Nonclairvoyant Network Design with Deadlines or Delay.. ICALP, volume 261 of LIPIcs, page 105:1-105:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Competitive Vertex Recoloring., , , and . ICALP, volume 229 of LIPIcs, page 13:1-13:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Approximate Nearest Neighbor Search through Modern Error-Correcting Codes., and . ICLR, OpenReview.net, (2023)Flow time scheduling with uncertain processing time., , and . STOC, page 1070-1080. ACM, (2021)Distortion-Oblivious Algorithms for Minimizing Flow Time., , and . SODA, page 252-274. SIAM, (2022)Improved and Deterministic Online Service with Deadlines or Delay.. STOC, page 761-774. ACM, (2023)Set Cover with Delay - Clairvoyance Is Not Required., , , and . ESA, volume 173 of LIPIcs, page 8:1-8:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)