Wun-Tat Chan

From MaRDI portal
Revision as of 12:03, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:814920

Available identifiers

zbMath Open chan.wun-tatMaRDI QIDQ814920

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q55018232015-08-14Paper
https://portal.mardi4nfdi.de/entity/Q29346662014-12-18Paper
A unified analysis of hot video schedulers2010-08-05Paper
Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops2010-01-06Paper
Improved on-line broadcast scheduling with deadlines2009-08-28Paper
On-line scheduling of parallel jobs on two machines2008-11-18Paper
Online bin packing of fragile objects with application in cellular networks2008-04-23Paper
Improved On-Line Broadcast Scheduling with Deadlines2007-09-10Paper
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis2007-09-10Paper
Efficient algorithms for finding a longest common increasing subsequence2007-07-19Paper
Algorithms and Computation2006-11-14Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling2006-09-14Paper
A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time2006-08-14Paper
On-line stream merging with max span and min coverage2006-02-08Paper
Computing and Combinatorics2006-01-11Paper
Automata, Languages and Programming2006-01-10Paper
Algorithms and Computation2005-12-22Paper
Computing and Combinatorics2005-06-15Paper
https://portal.mardi4nfdi.de/entity/Q44374982003-12-02Paper
Escaping a grid by edge-disjoint paths2003-08-19Paper
On-line stream merging in a general setting.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q47085692003-06-18Paper
https://portal.mardi4nfdi.de/entity/Q45532402002-11-04Paper
https://portal.mardi4nfdi.de/entity/Q27290902001-10-18Paper
Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids2000-08-28Paper
https://portal.mardi4nfdi.de/entity/Q49526932000-05-10Paper

Research outcomes over time

This page was built for person: Wun-Tat Chan