Amortized Computational Complexity¶
Tarjan, R. E. (1985). Amortized Computational Complexity. SIAM Journal on Algebraic and Discrete Methods.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Precomputation and Materialization
- Comparisons between systems that answer in a millisecond and systems that answer in a second are usually comparing placement, not capability.
This sourceFormalises the accounting view in which a cheap observed operation is paid for by expense charged elsewhere in the sequence, so the cost of a single fast operation is not by itself a measure of work done.
- Comparisons between systems that answer in a millisecond and systems that answer in a second are usually comparing placement, not capability.
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:0b5d80096bf3 · see in the full table