Skip to search formSkip to main contentSkip to account menu

Cache-oblivious distribution sort

The cache-oblivious distribution sort is a comparison-based sorting algorithm. It was introduced in 1999 in the context of the cache oblivious model… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations

Broader (2)

Analysis of algorithmsCache (computing)
Cache-oblivious algorithmComparison sortMedian of mediansSorting algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2003
2003
1 Cache-efficient sorting for Burrows-Wheeler Transform
The expensive activity during compression in the Burrows-Wheeler Transform (BWT) is sorting of all the rotations of the block of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)