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

The k-metric dimension., and . J. Comb. Optim., 34 (1): 1-30 (2017)Multidimensional Packing Problems., and . Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, (2007)Transactional contention management as a non-clairvoyant scheduling problem., , , and . PODC, page 308-315. ACM, (2006)Models for the k-metric dimension., and . CoRR, (2014)Generalized selfish bin packing, and . CoRR, (2012)Covering selfish machines, and . CoRR, (2006)The Metric Dimension of Two-Dimensional Extended Meshes., and . Acta Cybern., 23 (3): 761-772 (2018)Paging with Request Sets., , and . SWAT, volume 4059 of Lecture Notes in Computer Science, page 124-135. Springer, (2006)The Maximum Resource Bin Packing Problem., , , , , , and . FCT, volume 3623 of Lecture Notes in Computer Science, page 397-408. Springer, (2005)Selfish Bin Packing., and . ESA, volume 5193 of Lecture Notes in Computer Science, page 368-380. Springer, (2008)