Strongly Competitive Algorithms for Paging with Locality of Reference (Q4887013)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 908222
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
3 February 1997
0 references
paging algorithm
0 references
optimal algorithms
0 references
undirected access graphs
0 references
structured program graphs
0 references
0.9974223971366882
0 references
0.9169952869415284
0 references
0.9160515069961548
0 references
