The following pages link to (Q3138907):
Displaying 12 items.
- A better lower bound on the competitive ratio of the randomized 2-server problem (Q287141) (← links)
- On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
- Deadline scheduling and power management for speed bounded processors (Q708210) (← links)
- Randomized competitive algorithms for the list update problem (Q1312185) (← links)
- Competitive \(k\)-server algorithms (Q1329151) (← links)
- Non-additive two-option ski rental (Q2345456) (← links)
- Online speed scaling based on active job count to minimize flow plus energy (Q2392927) (← links)
- On Advice Complexity of the k-server Problem under Sparse Metrics (Q2868631) (← links)
- Non-Additive Two-Option Ski Rental (Q2868633) (← links)
- On Energy-Efficient Computations With Advice (Q3196431) (← links)
- Multi-Priority Online Scheduling with Cancellations (Q4969311) (← links)
- On the Bahncard problem (Q5958720) (← links)
