HARMONIC is 3-competitive for two servers (Q1193886)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: HARMONIC is 3-competitive for two servers |
scientific article; zbMATH DE number 65320
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | HARMONIC is 3-competitive for two servers |
scientific article; zbMATH DE number 65320 |
Statements
HARMONIC is 3-competitive for two servers (English)
0 references
27 September 1992
0 references
\(k\)-server problem
0 references
competitiveness
0 references
