Bounding the power of preemption in randomized scheduling
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Throughput-competitive admission control for continuous media databases
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Eliminating migration in multi-processor scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Competitive on-line scheduling of continuous-media streams
Journal of Computer and System Sciences
On the speed requirement for optimal deadline scheduling in overloaded systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Online Scheduling of Parallel Communications with Individual Deadlines
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Competitive Online Scheduling with Level of Service
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Maximizing Job Completions Online
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Interval selection: applications, algorithms, and lower bounds
Journal of Algorithms
Maximizing job completions online
Journal of Algorithms
An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem
Journal of Scheduling
Competitive on-line scheduling with level of service
Journal of Scheduling - Special issue: On-line scheduling
Scheduling broadcasts with deadlines
Theoretical Computer Science - Special papers from: COCOON 2003
A tight lower bound for job scheduling with cancellation
Information Processing Letters
On-demand bounded broadcast scheduling with tight deadlines
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
A near optimal scheduler for on-demand data broadcasts
Theoretical Computer Science
Improved on-line broadcast scheduling with deadlines
Journal of Scheduling
Lower bounds on online deadline scheduling with preemption penalties
Information Processing Letters
Improved Randomized Results for That Interval Selection Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A note on on-line broadcast scheduling with deadlines
Information Processing Letters
Online story scheduling in web advertising
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
Approximation and Online Algorithms
Online allocation of display advertisements subject to advanced sales contracts
Proceedings of the Third International Workshop on Data Mining and Audience Intelligence for Advertising
Transport logistics planning with service-level constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A tight lower bound for job scheduling with cancellation
Information Processing Letters
Scheduling broadcasts with deadlines
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Improved upper bounds on the competitive ratio for online realtime scheduling
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Improved randomized results for the interval selection problem
Theoretical Computer Science
Online splitting interval scheduling on m identical machines
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Online preemptive scheduling with immediate decision or notification and penalties
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Interval scheduling on related machines
Computers and Operations Research
TOFU: semi-truthful online frequency allocation mechanism for wireless network
IEEE/ACM Transactions on Networking (TON)
Laxity helps in broadcast scheduling
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
On-line simultaneous maximization of the size and the weight for degradable intervals schedules
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Improved on-line broadcast scheduling with deadlines
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
A near optimal scheduler for on-demand data broadcasts
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On-Line bicriteria interval scheduling
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Online selection of intervals and t-intervals
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
On-line scheduling of equal-length intervals on parallel machines
Information Processing Letters
Randomized online interval scheduling
Operations Research Letters
Space-constrained interval selection
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Online interval scheduling on a single machine with finite lookahead
Computers and Operations Research
Online interval scheduling: randomized and multiprocessor cases
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Open problems in throughput scheduling
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
SIGACT news online algorithms column 21: APPROX and ALGO
ACM SIGACT News
On-demand bounded broadcast scheduling with tight deadlines
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Online selection of intervals and t-intervals
Information and Computation
Online scheduling with preemption or non-completion penalties
Journal of Scheduling
| Hi-index | 0.00 |