Online algorithms for market clearing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Simple Algorithms for a Weighted Interval Selection Problem
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Interval selection: applications, algorithms, and lower bounds
Journal of Algorithms
Online deadline scheduling: multiple machines and randomization
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem
Journal of Scheduling
Packet-mode policies for input-queued switches
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Patience is a virtue: the effect of slack on competitiveness for admission control
Journal of Scheduling - Special issue: On-line algorithm part I
Admission control with immediate notification
Journal of Scheduling - Special issue: On-line scheduling
Operating Systems for Reconfigurable Embedded Platforms: Online Scheduling of Real-Time Tasks
IEEE Transactions on Computers
Online algorithms for market clearing
Journal of the ACM (JACM)
How much can lookahead help in online single machine scheduling
Information Processing Letters
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
Theoretical Computer Science
Online nonpreemptive scheduling of equal-length jobs on two identical machines
ACM Transactions on Algorithms (TALG)
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
Approximation and Online Algorithms
Online deadline scheduling with bounded energy efficiency
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Online scheduling of equal-length jobs on parallel machines
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Improved upper bounds on the competitive ratio for online realtime scheduling
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
Computers and Operations Research
Online deadline scheduling with preemption penalties
Computers and Industrial Engineering
Temperature aware online algorithms for scheduling equal length jobs
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Online, non-preemptive scheduling of equal-length jobs on two identical machines
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Online scheduling with hard deadlines on parallel machines
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Laxity helps in broadcast scheduling
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Dispatching equal-length jobs to parallel machines to maximize throughput
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Open problems in throughput scheduling
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Temperature aware online algorithms for scheduling equal length jobs
Theoretical Computer Science
| Hi-index | 0.01 |