Theoremadvanced
k-competitiveness of LRU
Also called Sleator-Tarjan theorem for LRU.
LRU is k-competitive against the optimal offline algorithm with cache size k.
LRU is k-competitive against the optimal offline algorithm with cache size k.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag JZN82D Edit this page History Report an error