( en | de | ru )

 

Disambiguation of "Jez, Lukasz"

Author of the publication

copydeleteadd this publication to your clipboard
Online Disjoint Set Covers: Randomization is not Necessary.

, , and . CoRR, (2024)

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.

Uta Jez

Lukasz Skora

High-resolution characterization of structural changes involved in prion diseases and dialysis-related amyloidosis. Uni Göttingen, (2009)

Günther Jezewski

Katarzyna Jezierska

Stefan Jezierski

 

Other publications of authors with the same name

A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue., , , , , , and . Theor. Comput. Sci., (2013)Tight Bounds for Double Coverage Against Weak Adversaries., , , , and . Theory Comput. Syst., 62 (2): 349-365 (2018)Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics., , and . ISAAC, volume 149 of LIPIcs, page 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A Universal Randomized Packet Scheduling Algorithm.. Algorithmica, 67 (4): 498-515 (2013)Scheduling multipacket frames with frame deadlines., , and . J. Sched., 20 (6): 623-634 (2017)Online Scheduling of Bounded Length Jobs to Maximize Throughput., , and . WAOA, volume 5893 of Lecture Notes in Computer Science, page 116-127. Springer, (2009)Tight Bounds for Double Coverage Against Weak Adversaries., , , , and . WAOA, volume 9499 of Lecture Notes in Computer Science, page 47-58. Springer, (2015)Better bounds for incremental frequency allocation in bipartite graphs., , and . Theor. Comput. Sci., (2013)Mechanism Design for Aggregating Energy Consumption and Quality of Service in Speed Scaling Scheduling., , and . WINE, volume 8289 of Lecture Notes in Computer Science, page 134-145. Springer, (2013)Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems., , , and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 101-113. Springer, (2022)