Skip to content

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.

Type
Conference paper
Intellectual base
Primary research
Year
1999
DOI
10.1109/sffcs.1999.814600
Link
https://doi.org/10.1109/SFFCS.1999.814600
Cited from
computer_science

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 (tier C, never cited in body). 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

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:775652906405 · see in the full table