The Influence of Caches on the Performance of Sorting

DOI10.1006/jagm.1998.0985zbMath0928.68035OpenAlexW2776089907WikidataQ56533174 ScholiaQ56533174MaRDI QIDQ4240128

Anthony LaMarca, Richard E. Ladner

Publication date: 9 January 2000

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1998.0985

zbMATH Keywords

sorting algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (6)

Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme ⋮ The cost of cache-oblivious searching ⋮ High Performance Rearrangement and Multiplication Routines for Sparse Tensor Arithmetic ⋮ BlockQuicksort ⋮ A fast algorithm for computing distance correlation ⋮ A blocked all-pairs shortest-paths algorithm

This page was built for publication: The Influence of Caches on the Performance of Sorting