scientific article; zbMATH DE number 432777

MaRDI QIDQ3138907zbMATH OpenFDO

Authors Anna R. Karlin, L. A. McGeoch, Susan Owicki, M. S. Manasse

Publication date 19 September 1994

zbMATH Keywords

randomized algorithmscompetitive analysisonline algorithm

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cited in

(12)

• Randomized competitive algorithms for the list update problem
• Multi-priority online scheduling with cancellations
• A better lower bound on the competitive ratio of the randomized 2-server problem
• On the Bahncard problem
• On energy-efficient computations with advice
• Online speed scaling based on active job count to minimize flow plus energy
• Non-additive two-option ski rental
• On advice complexity of the \(k\)-server problem under sparse metrics
• Competitive \(k\)-server algorithms
• On the advice complexity of the \(k\)-server problem under sparse metrics
• Non-additive two-option ski rental
• Deadline scheduling and power management for speed bounded processors

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138907)