Author of the publication

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 Complexity of Scheduling for p-norms of Flow and Stretch, , and . CoRR, (2013)Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms., , , , and . CoRR, (2017)The Online Set Aggregation Problem., , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 245-259. Springer, (2018)Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks., , and . SPAA, page 294-303. ACM, (2015)An Empirical Study of Online Packet Scheduling Algorithms., and . SEA, volume 9685 of Lecture Notes in Computer Science, page 278-293. Springer, (2016)Fast algorithms for knapsack via convolution and prediction., , , and . STOC, page 1269-1282. ACM, (2018)Bounded-space online bin cover., and . J. Sched., 12 (5): 461-474 (2009)On A Strictly Convex IBM Model 1., , and . EMNLP, page 221-226. The Association for Computational Linguistics, (2015)A Convex Alternative to IBM Model 2., , and . EMNLP, page 1574-1583. ACL, (2013)Divide-and-Conquer Approximation Algorithm for Vertex Cover., and . SIAM J. Discret. Math., 23 (3): 1261-1280 (2009)