Amortized efficiency of list update and paging rules¶
Sleator, D. D., & Tarjan, R. E. (1985). Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2), 202-208.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Competition
- The algorithm-design notion of competitive ratio runs the transfer the other direction, importing into computer science the idea of measuring an agent against a best-possible rival — a formalization of relative performance that originated in the intuition of contests.
This sourceIntroduces competitive analysis (the competitive ratio), measuring an online algorithm's worst-case cost against an optimal offline adversary that sees the whole input in advance — the formalization of relative performance against a best-possible rival imported into computer science.
- The algorithm-design notion of competitive ratio runs the transfer the other direction, importing into computer science the idea of measuring an agent against a best-possible rival — a formalization of relative performance that originated in the intuition of contests.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:c427243bfe5d · see in the full table