( en | de | ru )

 

Disambiguation of "Epstein, Leah"

Author of the publication

copydeleteadd this publication to your clipboard
Online Scheduling of Jobs with Fixed Start Times on Related Machines.

, , , and . Algorithmica, 74 (1): 156-176 (2016)

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.

Angela Leahy

Breandán Leahy

Leah Sharp

Leah Eissing

Leah Herrgen

 

Other publications of authors with the same name

Transactional contention management as a non-clairvoyant scheduling problem., , , and . PODC, page 308-315. ACM, (2006)The Metric Dimension of Two-Dimensional Extended Meshes., and . Acta Cybern., 23 (3): 761-772 (2018)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 on Uniform Processors with Non-decreasing Speed Ratios.. STACS, volume 2010 of Lecture Notes in Computer Science, page 230-237. Springer, (2001)The Maximum Resource Bin Packing Problem., , , , , , and . FCT, volume 3623 of Lecture Notes in Computer Science, page 397-408. Springer, (2005)This Side Up!, and . WAOA, volume 3351 of Lecture Notes in Computer Science, page 48-60. Springer, (2004)The cost of selfishness for maximizing the minimum load on uniformly related machines., , and . J. Comb. Optim., 27 (4): 767-777 (2014)Multidimensional Packing Problems., and . Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, (2007)The k-metric dimension., and . J. Comb. Optim., 34 (1): 1-30 (2017)Generalized selfish bin packing, and . CoRR, (2012)