Cache-oblivious algorithms¶
Frigo, M., Leiserson, C. E., Prokop, H., & Ramachandran, S. (1999). Cache-oblivious algorithms. Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 285-298.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Complexity (Time/Space)
This sourceIntroduces the ideal-cache model and cache-oblivious algorithms (matrix transpose, FFT, sorting) that are asymptotically optimal across cache levels without tuning. Bibliography-only CITATION-FIX: the file listed 'Leiserson, C. E., & Propp, J. G. (2000). Cache-oblivious algorithms. Proc. 41st FOCS' — wrong author (Propp), wrong year/venue (41st FOCS / 2000); the actual paper is Frigo et al., 40th FOCS, 1999.
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:775652906405 · see in the full table