\textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm (Q2344206)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm |
scientific article |
Statements
\textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm (English)
0 references
12 May 2015
0 references
on-line algorithms
0 references
competitive analysis
0 references
paging
0 references
randomized algorithms
0 references
