( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Distortion-Oblivious Algorithms for Minimizing Flow Time.

, , и . SODA, стр. 252-274. SIAM, (2022)

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.

Noam Pilpel

 

Другие публикации лиц с тем же именем

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