The harmonic <i>k</i> -server algorithm is competitive (Q5487824): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/331605.331606 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051069559 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:47, 19 March 2024
scientific article; zbMATH DE number 5052707
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The harmonic <i>k</i> -server algorithm is competitive |
scientific article; zbMATH DE number 5052707 |
Statements
The harmonic <i>k</i> -server algorithm is competitive (English)
0 references
12 September 2006
0 references
generalization of paging problems
0 references
Harmonic \(k\)-server algorithm
0 references
