Strongly Competitive Algorithms for Paging with Locality of Reference (Q4887013): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539792236353 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073713788 / rank | |||
Normal rank | |||
Latest revision as of 10:56, 30 July 2024
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
3 February 1997
0 references
paging algorithm
0 references
optimal algorithms
0 references
undirected access graphs
0 references
structured program graphs
0 references
