On the public citation graph

How Branch Mispredictions Affect Quicksort

0 signed · 25 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11534273_34openalex-snapshot
Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms
inferredcites →https://doi.org/10.1007/3-540-44634-6openalex-snapshot
Algorithms and Data Structures
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.1137/s0097539700382108openalex-snapshot
Optimal Sampling Strategies in Quicksort and Quickselect
inferredcites →https://doi.org/10.1145/366622.366644openalex-snapshot
Algorithm 64: Quicksort
inferredcites →https://doi.org/10.1145/366622.366647openalex-snapshot
Algorithm 65: find
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/978-3-642-14866-8_5openalex-snapshot
Chapter 5. Realistic Computer Models
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_15openalex-snapshot
Branch Mispredictions Don’t Affect Mergesort
inferred← citeshttps://doi.org/10.1007/978-3-642-38527-8_13openalex-snapshot
Branchless Search Programs
inferred← citeshttps://doi.org/10.1007/s00453-015-0041-7openalex-snapshot
Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy’s Partitioning Scheme
inferred← citeshttps://doi.org/10.1007/s41060-021-00270-4openalex-snapshot
CPI-model-based analysis of sparse k-means clustering algorithms
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.1093/comjnl/bxv063openalex-snapshot
Fast Quicksort Implementation Using AVX Instructions
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/2963102openalex-snapshot
How Good Is Multi-Pivot Quicksort?
inferred← citeshttps://doi.org/10.1145/3274660openalex-snapshot
BlockQuicksort
inferred← citeshttps://doi.org/10.1145/3505286openalex-snapshot
Engineering In-place (Shared-memory) Sorting Algorithms
inferred← citeshttps://doi.org/10.22028/d291-25941openalex-snapshot
Traversing large graphs in realistic settings
inferred← citeshttps://doi.org/10.48550/arxiv.1403.6602openalex-snapshot
Pivot Sampling in Dual-Pivot Quicksort
inferred← citeshttps://doi.org/10.48550/arxiv.2002.09094openalex-snapshot
Inverted-File k-Means Clustering: Performance Analysis
inferred← citeshttps://doi.org/10.5445/ir/1000085031openalex-snapshot
Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools
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.