( en | de | ru )

 

Disambiguation of "Tamir, Tami"

Author of the publication

copydeleteadd this publication to your clipboard
Transactional contention management as a non-clairvoyant scheduling problem.

, , , and . PODC, page 308-315. ACM, (2006)

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.

Berhan Tamir

Dereje Tamiru

Elias Tamiru

Tamiru Negash Alkie

Jamshid Tamiry

 

Other publications of authors with the same name

All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns., , , , , , , and . ACM Trans. Algorithms, 12 (3): 38:1-38:25 (2016)Minimizing Makespan and Preemption Costs on a System of Uniform Machines., , and . Algorithmica, 42 (3-4): 309-334 (2005)On Chromatic Sums and Distributed Resource Allocation., , and . ISTCS, page 119-128. IEEE Computer Society, (1996)A Theory and Algorithms for Combinatorial Reoptimization., , , and . Algorithmica, 80 (2): 576-607 (2018)Network-Formation Games with Regular Objectives., , and . FoSSaCS, volume 8412 of Lecture Notes in Computer Science, page 119-133. Springer, (2014)Approximation Schemes for Packing with Item Fragmentation., , and . WAOA, volume 3879 of Lecture Notes in Computer Science, page 334-347. Springer, (2005)Real-Time Scheduling with a Budget., , and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 1123-1137. Springer, (2003)Transactional Contention Management as a Non-Clairvoyant Scheduling Problem., , , and . Algorithmica, 57 (1): 44-61 (2010)Properties and Utilization of Capacitated Automata (Invited Talk)., and . FSTTCS, volume 29 of LIPIcs, page 33-44. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Approximation schemes for generalized two-dimensional vector packing with application to data placement., and . J. Discrete Algorithms, (2012)