Engineering a cache-oblivious sorting algorithm

DOI10.1145/1227161.1227164zbMath1140.68368OpenAlexW2127902590MaRDI QIDQ3507783

Rolf Fagerberg, Kristoffer Vinther, Gerth Stølting Brodal

Publication date: 20 June 2008

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1227161.1227164

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (6)

Cache Oblivious Algorithms for Computing the Triplet Distance between Trees ⋮ External-memory sorting with comparison errors ⋮ Optimal cache-oblivious mesh layouts ⋮ BlockQuicksort ⋮ Design and Engineering of External Memory Traversal Algorithms for General Graphs ⋮ In-Place Parallel Super Scalar Samplesort (IPSSSSo)

Uses Software

• TPIE

This page was built for publication: Engineering a cache-oblivious sorting algorithm