Author of the publication

Tight Bounds for Double Coverage Against Weak Adversaries.

, , , , and . WAOA, volume 9499 of Lecture Notes in Computer Science, page 47-58. Springer, (2015)

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

Scalably scheduling processes with arbitrary speedup curves., and . ACM Trans. Algorithms, 8 (3): 28:1-28:10 (2012)Minimizing flow time nonclairvoyantly., and . J. ACM, 50 (4): 551-567 (2003)A Competitive Analysis of Nearest Neighbor Based Algorithms for Searching Unknown Scenes (Preliminary Version)., and . STACS, volume 577 of Lecture Notes in Computer Science, page 147-157. Springer, (1992)Energy Efficient Caching for Phase-Change Memory., , , , and . MedAlg, volume 7659 of Lecture Notes in Computer Science, page 67-81. Springer, (2012)Dynamic Spectrum Allocation: The Impotency of Duration Notification., and . FSTTCS, volume 1974 of Lecture Notes in Computer Science, page 421-428. Springer, (2000)Eliminating Migration in Multi-Processor Scheduling., and . SODA, page 499-506. ACM/SIAM, (1999)Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing., , , and . STOC, page 734-743. ACM, (2014)Editorial., and . J. Sched., 12 (5): 435-436 (2009)Dedication.. J. Sched., 6 (3): 229 (2003)Getting the Best Response for Your Erg., , and . SWAT, volume 3111 of Lecture Notes in Computer Science, page 14-25. Springer, (2004)