New algorithms for an ancient scheduling problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling
SIAM Journal on Computing
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Tighter bounds on a heuristic for a partition problem
Information Processing Letters
Better bounds for online scheduling
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation schemes for scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Load balancing in the L/sub p/ norm
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Minimizing the Maximum Starting Time On-line
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
| Hi-index | 0.00 |