MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 25 documents:

  1. A unified approach to truthful scheduling on related machines
    Leah Epstein, Asaf Levin, and Rob van Stee
    In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, USA, 2013, 1243-1252
    [PDF: Download: monotone_PTAS_SODA_proceedings.pdf]
  2. Maximizing the minimum load: The cost of selfishness
    Xujin Chen, Leah Epstein, Elena Kleiman, and Rob van Stee
    Theoretical Computer Science 482: 9-19, 2013

  3. Approximation Schemes for Packing Splittable Items with Cardinality Constraints
    Leah Epstein, Asaf Levin, and Rob van Stee
    Algorithmica 62 (1-2): 102-129, 2012
    [Download: cards-j_revised2.dvi]
  4. Online Scheduling of Jobs with Fixed Start Times on Related Machines
    Leah Epstein, Lukasz Jez, Jiri Sgall, and Rob van Stee
    In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, Boston, USA, 2012, 134-145

  5. The price of anarchy on uniformly related machines revisited
    Leah Epstein and Rob van Stee
    Information and Computation 212: 37-54, 2012

  6. Universal sequencing on an unreliable machine
    Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julian Mestre, Martin Skutella, and Leen Stougie
    SIAM Journal on Computing 41 (3): 565-586, 2012
  7. Improved results for a memory allocation problem
    Leah Epstein and Rob van Stee
    Theory of Computing Systems 48 (1): 79-92, 2011
    [PDF: Download: splitemj9.pdf]
  8. Max-min online allocations with a reordering buffer
    Leah Epstein, Asaf Levin, and Rob van Stee
    SIAM Journal on Discrete Mathematics 25 (3): 1230-1250, 2011
    [Download: bcover_jour2.dvi] [PDF: Download: bcover_jour5_rev_sec.pdf]
  9. On the online unit clustering problem
    Leah Epstein and Rob van Stee
    ACM Transactions on Algorithms 7 (1): 7:1-7:1, 2011
  10. Improved approximation guarantees for weighted matching in the semi-streaming model
    Leah Epstein, Asaf Levin, Julian Mestre, and Danny Segev
    In: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), Nancy, France, 2010, 347-358
  11. Max-min online allocations with a reordering buffer
    Leah Epstein, Asaf Levin, and Rob van Stee
    In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, Bordeaux, France, 2010, 336-347

  12. Maximizing the minimum load for selfish agents
    Leah Epstein and Rob van Stee
    Theoretical Computer Science 411 (1): 44-57, 2010
  13. On the online unit clustering problem
    Leah Epstein and Rob van Stee
    ACM Transactions on Algorithms 7 (1): 1-18, 2010

  14. Universal sequencing on a single machine
    Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julian Mestre, Martin Skutella, and Leen Stougie
    In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, Lausanne, Switzerland, 2010, 230-243
  15. Maximizing the Minimum Load: The Cost of Selfishness
    Leah Epstein, Elena Kleiman, and Rob van Stee
    In: Internet and Network Economics : 5th International Workshop, WINE 2009, Rome, Italy, 2009, 232-243
  16. Paging with request sets
    Leah Epstein, Rob van Stee, and Tami Tamir
    Theory of Computing Systems 44 (1): 67-81, 2009
    [PDF: Download: pagesets-j3.pdf]
  17. Parametric Packing of Selfish Items and the Subset Sum Algorithm
    Leah Epstein, Elena Kleiman, and Julian Mestre
    In: Internet and Network Economics : 5th International Workshop, WINE 2009, Rome, Italy, 2009, 67-78
  18. Approximation schemes for packing splittable items with cardinality constraints
    Leah Epstein and Rob van Stee
    In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, 2008, 232-245
    [PS: Download: cards-j.ps]
  19. Maximizing the minimum load for selfish agents
    Leah Epstein and Rob van Stee
    In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, 2008, 264-275
    [Download: cover16.dvi]
  20. On the Online Unit Clustering Problem
    Leah Epstein and Rob van Stee
    In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, 2008, 193-206
    [Download: unitj3.dvi]
  21. Online unit clustering: Variations on a theme
    Leah Epstein, Asaf Levin, and Rob van Stee
    Theoretical Computer Science 407 (1-3): 85-96, 2008
    [PDF: Download: unitcard_jour2.pdf]
  22. The price of anarchy on uniformly related machines revisited
    Leah Epstein and Rob van Stee
    In: Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, 2008, 46-57
    [Download: poa-sagt.dvi]
  23. Two-dimensional packing with conflicts
    Leah Epstein, Asaf Levin, and Rob van Stee
    Acta Informatica 45 (3): 155-175, 2008
    [Download: area_perf_jour_revised.dvi]
  24. More on weighted servers or FIFO is better than LRU
    Leah Epstein, Csanád Imreh, and Rob van Stee
    In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, Warsawa-Otwock, Poland, 2002, 257-268
  25. On the remote server problem or more about TCP acknowledgments
    Leah Epstein and Alexander Kesselman
    Theoretical Computer Science 369 (1-3): 285 p., 2006