Dynamic TCP acknowledgement and other stories about e/(e-1)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
An optimal online algorithm for scheduling two machines with release times
Theoretical Computer Science
On randomized online scheduling
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Resource Augmentation in Load Balancing
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
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
An Experimental Study of Online Scheduling Algorithms
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
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)
Barely random algorithms for multiprocessor scheduling
Journal of Scheduling - Special issue: On-line scheduling
Online scheduling of splittable tasks
ACM Transactions on Algorithms (TALG)
Optimal semi-online preemptive algorithms for machine covering on two uniform machines
Theoretical Computer Science
Preemptive online scheduling: optimal algorithms for all speeds
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Preemptive scheduling on a small number of hierarchical machines
Information and Computation
Online Scheduling with Bounded Migration
Mathematics of Operations Research
Randomized priority algorithms
Theoretical Computer Science
A robust PTAS for machine covering and packing
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Robust algorithms for preemptive scheduling
ESA'11 Proceedings of the 19th European conference on Algorithms
Preemptive Online Scheduling with Reordering
SIAM Journal on Discrete Mathematics
Semi-online scheduling revisited
Theoretical Computer Science
A lower bound for on-line scheduling on uniformly related machines
Operations Research Letters
Semi-online scheduling with decreasing job sizes
Operations Research Letters
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
Operations Research Letters
Randomized on-line scheduling on three processors
Operations Research Letters
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
Operations Research Letters
On the value of job migration in online makespan minimization
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Recent advances for a classical scheduling problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.90 |