( en | de | ru )

 

Disambiguation of "Chan, Wun-Tat"

Author of the publication

copydeleteadd this publication to your clipboard
New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling.

, , , and . MFCS, volume 3618 of Lecture Notes in Computer Science, page 236-247. Springer, (2005)

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.

Keykhosrow Tat

Manutschehr Tat

Sara Tat

Amin Tat

Huschang Tat

 

Other publications of authors with the same name

Efficient Algorithms for Finding a Longest Common Increasing Subsequence., , , , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 665-674. Springer, (2005)A unified analysis of hot video schedulers., , , and . STOC, page 179-188. ACM, (2002)On-Line Windows Scheduling of Temporary Items., and . ISAAC, volume 3341 of Lecture Notes in Computer Science, page 259-270. Springer, (2004)Algorithms for Finding Optimal Disjoint Paths Around a Rectangle., and . ISAAC, volume 1350 of Lecture Notes in Computer Science, page 314-323. Springer, (1997)New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling., , , and . MFCS, volume 3618 of Lecture Notes in Computer Science, page 236-247. Springer, (2005)Competitive Analysis of On-line Stream Merging Algorithms., , , and . MFCS, volume 2420 of Lecture Notes in Computer Science, page 188-200. Springer, (2002)On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis., , and . COCOON, volume 4112 of Lecture Notes in Computer Science, page 309-319. Springer, (2006)Improved On-Line Broadcast Scheduling with Deadlines., , , , , and . COCOON, volume 4112 of Lecture Notes in Computer Science, page 320-329. Springer, (2006)On-Line Stream Merging, Max Span, and Min Coverage., , , and . CIAC, volume 2653 of Lecture Notes in Computer Science, page 70-82. Springer, (2003)Escaping a grid by edge-disjoint paths., , and . SODA, page 726-734. ACM/SIAM, (2000)