Cache-Oblivious Sorting, 1999; Frigo, Leiserson, Prokop, Ramachandran


2002 ◽  
Vol 9 (18) ◽  
Author(s):  
Gerth Stølting Brodal ◽  
Rolf Fagerberg

<p>We adapt the distribution sweeping method to the cache oblivious model. Distribution sweeping is the name used for a general approach for divide-and-conquer algorithms where the combination of solved subproblems can be viewed as a merging process of streams. We demonstrate by a series of algorithms for specific problems the feasibility of the method in a cache oblivious setting. The problems all come from computational geometry, and are: orthogonal line segment intersection reporting, the all nearest neighbors problem, the 3D maxima problem, computing the measure of a set of axis-parallel rectangles, computing the visibility of a set of line segments from a point, batched orthogonal range queries, and reporting pairwise intersections of axis-parallel rectangles. Our basic building block is a simplified version of the cache oblivious sorting algorithm Funnelsort of Frigo et al., which is of independent interest.</p><p> </p><p>Full text: http://dx.doi.org/10.1007/3-540-45465-9_37</p>



2016 ◽  
pp. 269-273
Author(s):  
Gerth Stølting


2008 ◽  
Vol 12 ◽  
pp. 1-23 ◽  
Author(s):  
Gerth Stølting Brodal ◽  
Rolf Fagerberg ◽  
Kristoffer Vinther


Author(s):  
T-H. Hubert Chan ◽  
Yue Guo ◽  
Wei-Kai Lin ◽  
Elaine Shi


2008 ◽  
pp. 126-129
Author(s):  
Gerth Stølting Brodal


Author(s):  
Gerth Stølting


2018 ◽  
Vol 14 (1) ◽  
pp. 1-33 ◽  
Author(s):  
Rezaul A. Chowdhury ◽  
Vijaya Ramachandran


2012 ◽  
Vol 27 (9) ◽  
pp. 2215-2234 ◽  
Author(s):  
Alexander Heinecke ◽  
Carsten Trinitis


Sign in / Sign up

Export Citation Format

Share Document