Amortized efficiency of list update and paging rules
Communications of the ACM
On the performance of on-line algorithms for partition problems
Acta Cybernetica
Scheduling parallel machines on-line
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
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
A better lower bound for on-line scheduling
Information Processing Letters
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)
A better algorithm for an ancient scheduling problem
Journal of Algorithms
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Multiprocessor scheduling with rejection
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
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
Randomized online scheduling on two uniform machines
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Ancient and new algorithms for load balancing in the Lp norm
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Trade-offs between speed and processor in hard-deadline scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
Applying extra-resource analysis to load balancing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Generating adversaries for request-answer games
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Dynamic TCP acknowledgement and other stories about e/(e-1)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Theoretical Computer Science
An optimal online algorithm for scheduling two machines with release times
Theoretical Computer Science
Temporary tasks assignment resolved
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Information Processing Letters
Resource Augmentation in Load Balancing
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
An Experimental Study of Online Scheduling Algorithms
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Adaptability and the Usefulness of Hints (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
On-Line Load Banancing in a Hierarchical Server Topology
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Scheduling Two Machines with Release Times
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
An experimental study of online scheduling algorithms
Journal of Experimental Algorithmics (JEA)
On-line algorithms for the channel assignment problem in cellular networks
Discrete Applied Mathematics
On-line multi-threaded scheduling
Journal of Scheduling - Special issue: On-line algorithm part I
Load-Balanced Short-Path Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
On-line load balancing made simple: Greedy strikes back
Journal of Discrete Algorithms
Online market driven spectrum scheduling and auction
Proceedings of the 2009 ACM workshop on Cognitive radio networks
Online load balancing made simple: greedy strikes back
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Return of the boss problem: competing online against a non-adaptive adversary
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
A lower bound for on-line scheduling on uniformly related machines
Operations Research Letters
Semi-online scheduling with decreasing job sizes
Operations Research Letters
| Hi-index | 0.00 |