New algorithms for an ancient scheduling problem
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Better bounds for online scheduling
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A better lower bound on the competitive ratio of the randomized 2-server problem
Information Processing Letters
Randomization in online computation
Randomization in online computation
Online computation and competitive analysis
Online computation and competitive analysis
Randomized Algorithms for that Ancient Scheduling Problem
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Developments from a June 1996 seminar on Online algorithms: the state of the art
Certifying and repairing solutions to large LPs how good are LP-solvers?
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Ordinal On-Line Scheduling on Two Uniform Machines
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
A lower bound for on-line scheduling on uniformly related machines
Operations Research Letters
Semi-on-line scheduling with ordinal data on two uniform machines
Operations Research Letters
| Hi-index | 0.00 |