OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm (Q2896387)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm |
scientific article |
Statements
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm (English)
0 references
16 July 2012
0 references
