Author of the publication

Transactional Contention Management as a Non-Clairvoyant Scheduling Problem.

, , , and . Algorithmica, 57 (1): 44-61 (2010)

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

On-Line and Off-Line Approximation Algorithms for Vector Covering Problems., , , , , , and . Algorithmica, 21 (1): 104-118 (1998)New Bounds for Variable-Sized Online Bin Packing., , and . SIAM J. Comput., 32 (2): 455-469 (2003)Covering selfish machines, and . CoRR, (2006)Generalized selfish bin packing, and . CoRR, (2012)Models for the k-metric dimension., and . CoRR, (2014)The Metric Dimension of Two-Dimensional Extended Meshes., and . Acta Cybern., 23 (3): 761-772 (2018)Transactional contention management as a non-clairvoyant scheduling problem., , , and . PODC, page 308-315. ACM, (2006)Selfish Bin Packing., and . ESA, volume 5193 of Lecture Notes in Computer Science, page 368-380. Springer, (2008)New Bounds for Variable-Sized and Resource Augmented Online Bin Packing., , and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 306-317. Springer, (2002)Optimal Preemptive Scheduling for General Target Functions., and . MFCS, volume 3153 of Lecture Notes in Computer Science, page 562-573. Springer, (2004)