( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics.

, , и . ISAAC, том 149 из LIPIcs, стр. 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

Marcin Bienkowski

Marcin Bienkowski

Marcin Bienkowski

Marcin Bienkowski

Marcin Bienkowski

 

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

Unbounded lower bound for k-server against weak adversaries., , , и . STOC, стр. 1165-1169. ACM, (2020)Better Bounds for Online Line Chasing., , , , , и . CoRR, (2018)Online Disjoint Set Covers: Randomization is not Necessary., , и . CoRR, (2024)Optimizing Reconfigurable Optical Datacenters: The Power of Randomization., , и . SC, стр. 83:1-83:11. ACM, (2023)Improved Analysis of Online Balanced Clustering., , , , , и . WAOA, том 12982 из Lecture Notes in Computer Science, стр. 224-233. Springer, (2021)Learning Minimum Linear Arrangement of Cliques and Lines., , , , и . ICDCS, стр. 175-185. IEEE, (2024)Better Bounds for Online Line Chasing., , , , , и . MFCS, том 138 из LIPIcs, стр. 8:1-8:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)An Improved Online Algorithm for the Traveling Repairperson Problem on a Line., и . MFCS, том 138 из LIPIcs, стр. 6:1-6:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Migrating and replicating data in networks.. Comput. Sci. Res. Dev., 27 (3): 169-179 (2012)An Improved Algorithm For Online Reranking., и . CoRR, (2022)