scientific article; zbMATH DE number 432825

zbMATH Open0800.68461MaRDI QIDQ3138959FDOQ3138959

Authors: Neal E. Young 

Publication date: 20 October 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

competitivenesson-line algorithmcache analysisk-server problem

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cited In (8)

• Title not available (Why is that?)
• 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)