scientific article; zbMATH DE number 65697

MaRDI QIDQ4010308zbMATH OpenFDO

Authors Neal E. Young

Publication date 27 September 1992

zbMATH Keywords

competitiveness\(K\)-server

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43)

Cited in

(2)

• Outperforming LRU via competitive analysis on parametrized inputs for paging
• A new measure for the study of on-line algorithms

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