Cache-aware and cache-oblivious adaptive sorting

DOI10.1007/11523468_47MaRDI QIDQ5716809zbMATH OpenOpenAlexFDO

Authors Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Adaptive sorting: an information theoretic perspective
• Adaptive sorting and the information theoretic lower bound
• Inversion-sensitive sorting algorithms in practice
• On adaptive integer sorting
• Randomized adaptive sorting

Cited in

(13)

• The weak-heap data structure: variants and applications
• Adaptive sorting: an information theoretic perspective
• Search-Order Independent State Caching
• Remote memory references at block granularity
• Engineering a cache-oblivious sorting algorithm
• On the limits of cache-obliviousness
• Adaptive sorting and the information theoretic lower bound
• Inversion-sensitive sorting algorithms in practice
• Efficient sorting using registers and caches
• On adaptive integer sorting
• Proximity MergeSort, optimal in-place sorting in the cache-oblivious model
• Optimal sparse matrix dense vector multiplication in the I/O-model
• Competitive data-structure dynamization

This page was built for publication: Cache-aware and cache-oblivious adaptive sorting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716809)