Cache Oblivious Distribution Sweeping
Citations
134 citations
Cites methods from "Cache Oblivious Distribution Sweepi..."
...Subsequently other sorting algorithms were found, such as lazy funnelsort [ 13 ], which only needs a relaxed form of the tall-cache assumption, namely M > B1+" for some " > 0. Brodal et al. [15] showed that cache-oblivious I/O-optimal sorting is impossible without a tall-cache assumption: then cacheoblivious algorithms are less powerful than EM ones....
[...]
124 citations
113 citations
100 citations
97 citations
References
11,671 citations
6,525 citations
"Cache Oblivious Distribution Sweepi..." refers methods in this paper
...Existing algorithms may have straightforward cache oblivious implementation—this is for example the case for the algorithm know as Graham’s scan [15] for computing the convex hull of a point set [12, 18]....
[...]
4,805 citations
3,419 citations
1,741 citations
"Cache Oblivious Distribution Sweepi..." refers methods in this paper
...Existing algorithms may have straightforward cache oblivious implementation—this is for example the case for the algorithm know as Graham’s scan [14] for computing the convex hull of a point set [11]....
[...]