Minimizing the Maximum Starting Time On-line
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Server scheduling in the Lp norm: a rising tide lifts all boat
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Minimizing flow time nonclairvoyantly
Journal of the ACM (JACM)
Non-clairvoyant scheduling for weighted flow time
Information Processing Letters
SRPT optimally utilizes faster machines to minimize flow time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A maiden analysis of Longest Wait First
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Competitive online scheduling for server systems
ACM SIGMETRICS Performance Evaluation Review
SRPT optimally utilizes faster machines to minimize flow time
ACM Transactions on Algorithms (TALG)
A note on on-line broadcast scheduling with deadlines
Information Processing Letters
Scalably scheduling processes with arbitrary speedup curves
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Online scheduling to minimize the maximum delay factor
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Minimizing the maximum starting time on-line
Information and Computation
Scheduling jobs with varying parallelizability to reduce variance
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
An online scalable algorithm for average flow time in broadcast scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Better scalable algorithms for broadcast scheduling
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Minimizing maximum flowtime of jobs with arbitrary parallelizability
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
SIAM Journal on Computing
An online scalable algorithm for minimizing lk-norms of weighted flow time on unrelated machines
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Online scalable scheduling for the lk-norms of flow time without conservation of work
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Online scheduling on identical machines using SRPT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Longest wait first for broadcast scheduling [extended abstract]
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Online algorithms to minimize resource reallocations and network communication
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Scalably scheduling processes with arbitrary speedup curves
ACM Transactions on Algorithms (TALG)
Non-clairvoyant weighted flow time scheduling on different multi-processor models
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Non-clairvoyant weighted flow time scheduling with rejection penalty
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
An online scalable algorithm for average flow time in broadcast scheduling
ACM Transactions on Algorithms (TALG)
On the competitiveness of AIMD-TCP within a general network
Theoretical Computer Science
Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |