On the public citation graph
Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms
0 signed · 29 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11523468_47openalex-snapshot
Cache-Aware and Cache-Oblivious Adaptive Sorting
inferredcites →https://doi.org/10.1007/11561071openalex-snapshot
Algorithms -- ESA 2005 : 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005 : proceedings
inferredcites →https://doi.org/10.1007/3-540-54029-6openalex-snapshot
Advances in Computing and Information — ICCI '91
inferredcites →https://doi.org/10.1007/978-3-540-30140-0_69openalex-snapshot
Super Scalar Sample Sort
inferredcites →https://doi.org/10.1007/b100428openalex-snapshot
Algorithms – ESA 2004 : 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings
inferredcites →https://doi.org/10.1016/0020-0190(91)90181-gopenalex-snapshot
Splitsort—an adaptive sorting algorithm
inferredcites →https://doi.org/10.1023/a:1008149332687openalex-snapshot
Worst Case Execution Time Analysis for a Processor with Branch Prediction
inferredcites →https://doi.org/10.1023/b:time.0000048933.15922.f9openalex-snapshot
Modeling Control Speculation for Timing Analysis
inferredcites →https://doi.org/10.1109/tc.1985.5009382openalex-snapshot
Measures of Presortedness and Optimal Sorting Algorithms
inferredcites →https://doi.org/10.1145/1227161.1402294openalex-snapshot
On the adaptiveness of Quicksort
inferredcites →https://doi.org/10.1145/139669.139709openalex-snapshot
Alternative implementations of two-level adaptive branch prediction
inferredcites →https://doi.org/10.1145/146370.146381openalex-snapshot
A survey of adaptive sorting algorithms
inferredcites →https://doi.org/10.1145/512274.512284openalex-snapshot
Algorithm 230: Matrix Permutation
inferredcites →https://doi.org/10.1145/800105.803395openalex-snapshot
A new representation for linear lists
inferredcites →https://doi.org/10.7146/brics.v11i27.21852openalex-snapshot
On the Adaptiveness of Quicksort
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11841036_69openalex-snapshot
How Branch Mispredictions Affect Quicksort
inferred← citeshttps://doi.org/10.1007/978-3-642-30347-0_14openalex-snapshot
Lean Programs, Branch Mispredictions, and Sorting
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_15openalex-snapshot
Branch Mispredictions Don’t Affect Mergesort
inferred← citeshttps://doi.org/10.1038/s41598-023-33583-4openalex-snapshot
Parallel Multi-Deque Partition Dual-Deque Merge sorting algorithm using OpenMP
inferred← citeshttps://doi.org/10.1137/1.9781611973761.11openalex-snapshot
Analysis of Branch Misses in Quicksort
inferred← citeshttps://doi.org/10.1137/1.9781611975499.2openalex-snapshot
Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme
inferred← citeshttps://doi.org/10.1145/1227161.1370599openalex-snapshot
An experimental study of sorting and branch prediction
inferred← citeshttps://doi.org/10.1145/1227161.1402294openalex-snapshot
On the adaptiveness of Quicksort
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.