Strongly Competitive Algorithms for Paging with Locality of Reference (Q4887013)

From MaRDI portal
Revision as of 10:56, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 908222
Language Label Description Also known as
English
Strongly Competitive Algorithms for Paging with Locality of Reference
scientific article; zbMATH DE number 908222

    Statements

    Strongly Competitive Algorithms for Paging with Locality of Reference (English)
    0 references
    0 references
    0 references
    0 references
    3 February 1997
    0 references
    paging algorithm
    0 references
    optimal algorithms
    0 references
    undirected access graphs
    0 references
    structured program graphs
    0 references

    Identifiers