scientific article

zbMath0800.68461MaRDI QIDQ3138959

Neal E. Young

Publication date: 20 October 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

on-line algorithmcompetitivenesscache analysisk-server problem

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items

Caching with Time Windows and Delays, Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost, Competitive clustering of stochastic communication patterns on a ring, Unnamed Item, Stochastic dominance and the bijective ratio of online algorithms, On competitive on-line paging with lookahead, A formula for incorporating weights into scoring rules, Competitive analysis of randomized paging algorithms