Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 385-395
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Modeling Control Speculation for Timing AnalysisReal-Time Systems, 2005
- On the Adaptiveness of QuicksortBRICS Report Series, 2004
- Super Scalar Sample Sort2004
- A survey of adaptive sorting algorithmsACM Computing Surveys, 1992
- Splitsort—an adaptive sorting algorithmInformation Processing Letters, 1991
- Practical adaptive sorting1991
- Measures of Presortedness and Optimal Sorting AlgorithmsIEEE Transactions on Computers, 1985
- A new representation for linear lists1977
- Algorithm 245: TreesortCommunications of the ACM, 1964
- Algorithm 230: Matrix PermutationCommunications of the ACM, 1964