\textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm (Q2344206)
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: \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm |
scientific article; zbMATH DE number 6435512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm |
scientific article; zbMATH DE number 6435512 |
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
0.9790935516357422
0 references
0.9100154638290404
0 references
0.8975329995155334
0 references
0.8914551734924316
0 references
0.8621968626976013
0 references
