scientific article; zbMATH DE number 432825

MaRDI QIDQ3138959zbMATH OpenFDO

Authors Neal E. Young

Publication date 20 October 1993

zbMATH Keywords

competitivenesson-line algorithmcache analysisk-server problem

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cited in

(8)

• scientific article; zbMATH DE number 7559165 (Why is no real title available?)
• Competitive clustering of stochastic communication patterns on a ring
• Caching with time windows and delays
• On competitive on-line paging with lookahead
• Stochastic dominance and the bijective ratio of online algorithms
• Competitive analysis of randomized paging algorithms
• Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
• A formula for incorporating weights into scoring rules

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 Q3138959)