Author of the publication

Improved Scheduling Algorithms for Minsum Criteria.

, , , , , and . ICALP, volume 1099 of Lecture Notes in Computer Science, page 646-657. Springer, (1996)

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

Strengthening integrality gaps for capacitated network design and covering problems., , , and . SODA, page 106-115. ACM/SIAM, (2000)The Online Event-Detection Problem., , , , , , , and . CoRR, (2018)Minimizing Phylogenetic Number to find Good Evolutionary Trees., , , , and . CPM, volume 937 of Lecture Notes in Computer Science, page 102-127. Springer, (1995)The Asymmetric Median Tree - A New model for Building Consensus Trees., and . CPM, volume 1075 of Lecture Notes in Computer Science, page 234-252. Springer, (1996)Improved Scheduling Algorithms for Minsum Criteria., , , , , and . ICALP, volume 1099 of Lecture Notes in Computer Science, page 646-657. Springer, (1996)Lessons Learned from 10k Experiments to Compare Virtual and Physical Testbeds., , , , and . CSET @ USENIX Security Symposium, USENIX Association, (2019)Dynamic Programming with Spiking Neural Computing., , , , , and . ICONS, page 20:1-20:9. ACM, (2019)Brief announcement: the impact of classical electronics constraints on a solid-state logical qubit memory., , , , , , , and . SPAA, page 166-168. ACM, (2009)The network inhibition problem.. STOC, page 776-785. ACM, (1993)Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem., , , , and . J. Comb. Optim., 1 (4): 413-426 (1998)