scientific article; zbMATH DE number 1445384
From MaRDI portal
Publication:4952707
Recommendations
Cited in
(28)- Cache-optimal algorithms for option pricing
- A short proof of optimality for the MIN cache replacement algorithm
- scientific article; zbMATH DE number 1984695 (Why is no real title available?)
- Another short proof of optimality for the MIN cache replacement algorithm
- Memory cache and lisp
- On the limits of cache-obliviousness
- The cache complexity of multithreaded cache oblivious algorithms
- scientific article; zbMATH DE number 2011837 (Why is no real title available?)
- On the importance of cache tuning in a cache-aware algorithm: a case study
- Towards a theory of cache-efficient algorithms
- Optimal cache-aware suffix selection
- Cache and I/O efficent functional algorithms
- On the Optimal Load-Memory Tradeoff of Cache-Aided Scalar Linear Function Retrieval
- An Experimental Evaluation of Global Caching for $\mathcal {ALC}$ (System Description)
- Cache-oblivious algorithms
- An analytical model for designing memory hierarchies
- Adapting Radix Sort to the Memory Hierarchy
- Analysing cache effects in distribution sorting
- The worst page-replacement policy
- scientific article; zbMATH DE number 2086622 (Why is no real title available?)
- Proximity MergeSort, optimal in-place sorting in the cache-oblivious model
- scientific article; zbMATH DE number 1756010 (Why is no real title available?)
- Improving memory performance of sorting algorithms
- Cache-independent algorithms
- Cache miss analysis of WHT algorithms
- Cache-adaptive algorithms
- Efficient algorithms with asymmetric read and write costs
- Optimal Worst Case Formulas Comparing Cache Memory Associativity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952707)
