scientific article; zbMATH DE number 2011837

MaRDI QIDQ4437489zbMATH OpenFDO

Authors Charles E. Leiserson

Publication date 2 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2653/26530005.htm

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms (68W40)

Recommendations

• Cache-oblivious algorithms
• Algorithm Theory - SWAT 2004
• Cache-independent algorithms
• Cache-adaptive algorithms
• On the limits of cache-obliviousness
• scientific article; zbMATH DE number 1445384
• Towards a theory of cache-efficient algorithms
• Cache-oblivious hashing
• Cache-oblivious and data-oblivious sorting and applications

Cited in

(31)

• A new approach to optimal cache scheduling
• Cache-independent algorithms
• On the importance of cache tuning in a cache-aware algorithm: a case study
• Cache oblivious matrix multiplication using an element ordering based on a Peano curve
• Cache and I/O efficent functional algorithms
• Cache-optimal algorithms for option pricing
• Network-oblivious algorithms
• Cache-oblivious algorithms
• Towards a theory of cache-efficient algorithms
• Engineering a cache-oblivious sorting algorithm
• On the limits of cache-obliviousness
• scientific article; zbMATH DE number 1956211 (Why is no real title available?)
• scientific article; zbMATH DE number 1755616 (Why is no real title available?)
• scientific article; zbMATH DE number 2086622 (Why is no real title available?)
• scientific article; zbMATH DE number 2086641 (Why is no real title available?)
• scientific article; zbMATH DE number 1445384 (Why is no real title available?)
• scientific article; zbMATH DE number 6315783 (Why is no real title available?)
• Algorithm Theory - SWAT 2004
• Cache-oblivious R-trees
• Cache-adaptive algorithms
• Algorithms – ESA 2005
• Proximity MergeSort, optimal in-place sorting in the cache-oblivious model
• Computational Science - ICCS 2004
• Languages and Compilers for Parallel Computing
• The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation
• Optimal cache-oblivious mesh layouts
• The cache complexity of multithreaded cache oblivious algorithms
• Oblivious algorithms for multicores and networks of processors
• On the limits of cache-oblivious rational permutations
• An empirical study of cache-oblivious polygon indecomposability testing
• Cache-oblivious selection in sorted \(X+Y\) matrices

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 Q4437489)