Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Better bounds for online scheduling
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Trade-offs between speed and processor in hard-deadline scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance [scheduling problems]
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Performance guarantee for online deadline scheduling in the presence of overload
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Extra processors versus future information in optimal deadline scheduling
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
On-line scheduling with tight deadlines
Theoretical Computer Science - Mathematical foundations of computer science
Competitive deadline scheduling via additional or faster processors
Journal of Scheduling - Special issue: On-line algorithm part I
Performance guarantee for EDF under overload
Journal of Algorithms
Optimal buffer management via resource augmentation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |