( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue.

, , , , , , и . Theor. Comput. Sci., (2013)

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.

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

 

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

Randomized Algorithm for Agreeable Deadlines Packet Scheduling.. STACS, том 5 из LIPIcs, стр. 489-500. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Lower bounds for online makespan minimization on a small number of related machines., , , и . J. Sched., 16 (5): 539-547 (2013)Mechanism Design for Aggregating Energy Consumption and Quality of Service in Speed Scaling Scheduling., , и . WINE, том 8289 из Lecture Notes in Computer Science, стр. 134-145. Springer, (2013)Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems., , , и . IWOCA, том 13270 из Lecture Notes in Computer Science, стр. 101-113. Springer, (2022)Pricing Online Decisions: Beyond Auctions., , , и . SODA, стр. 73-91. SIAM, (2015)Better Bounds for Online Line Chasing., , , , , и . CoRR, (2018)Unbounded lower bound for k-server against weak adversaries., , , и . STOC, стр. 1165-1169. ACM, (2020)Online Scheduling of Jobs with Fixed Start Times on Related Machines., , , и . APPROX-RANDOM, том 7408 из Lecture Notes in Computer Science, стр. 134-145. Springer, (2012)Online Disjoint Set Covers: Randomization is not Necessary., , и . CoRR, (2024)Dynamic Pricing of Servers on Trees., , , и . APPROX-RANDOM, том 145 из LIPIcs, стр. 10:1-10:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)