On the public citation graph

Vectorized and performance‐portable quicksort

0 signed · 31 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.1002/(sici)1097-024x(19990410)29:4<341::aid-spe237>3.0.co;2-ropenalex-snapshot
A killer adversary for quicksort
inferredcites →https://doi.org/10.1002/spe.2922openalex-snapshot
Engineering faster sorters for small sets of items
inferredcites →https://doi.org/10.1007/978-3-642-22603-8_58openalex-snapshot
Efficient Non-Quadratic Quick Sort (NQQuickSort)
inferredcites →https://doi.org/10.1007/978-3-642-23397-5_16openalex-snapshot
Engineering a Multi-core Radix Sort
inferredcites →https://doi.org/10.1016/0167-8191(90)90074-jopenalex-snapshot
A fully vectorized quicksort
inferredcites →https://doi.org/10.1016/j.jcss.2016.04.004openalex-snapshot
Sorting networks: To the end and back again
inferredcites →https://doi.org/10.1093/comjnl/17.4.324openalex-snapshot
The Art of Computer Programming, Volume 3, Sorting and Searching
inferredcites →https://doi.org/10.1093/comjnl/bxv063openalex-snapshot
Fast Quicksort Implementation Using AVX Instructions
inferredcites →https://doi.org/10.1109/coolchips.2016.7503679openalex-snapshot
How SIMD width affects energy efficiency: A case study on sorting
inferredcites →https://doi.org/10.1109/hpcc/smartcity/dss.2019.00038openalex-snapshot
Efficient Parallel Sort on AVX-512-Based Multi-Core and Many-Core Architectures
inferredcites →https://doi.org/10.1109/ispass.2018.00028openalex-snapshot
A Workload Characterization of the SPEC CPU2017 Benchmark Suite
inferredcites →https://doi.org/10.1109/tpds.2018.2789903openalex-snapshot
A Framework for the Automatic Vectorization of Parallel Sort on x86-Based Processors
inferredcites →https://doi.org/10.1109/tse.1978.231484openalex-snapshot
Sorting on STAR
inferredcites →https://doi.org/10.1137/1.9781611973198.6openalex-snapshot
Multi-Pivot Quicksort: Theory and Experiments
inferredcites →https://doi.org/10.1145/125826.126164openalex-snapshot
Radix sort for vector multiprocessors
inferredcites →https://doi.org/10.1145/3505286openalex-snapshot
Engineering In-place (Shared-memory) Sorting Algorithms
inferredcites →https://doi.org/10.14569/ijacsa.2017.081044openalex-snapshot
A Novel Hybrid Quicksort Algorithm Vectorized using AVX-512 on Intel Skylake
inferredcites →https://doi.org/10.14778/1454159.1454171openalex-snapshot
Efficient implementation of sorting on multi-core SIMD CPU architecture

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/spe.70011openalex-snapshot
SlowSort : An Enhanced Sorting Algorithm for Large‐Scale Integer Datasets
inferred← citeshttps://doi.org/10.1007/978-3-031-21534-6openalex-snapshot
Algorithms for Big Data
inferred← citeshttps://doi.org/10.1007/978-3-031-57246-3_15openalex-snapshot
Formally Verifying an Efficient Sorter
inferred← citeshttps://doi.org/10.1007/978-3-032-24923-4_5openalex-snapshot
Fast Sorting for the RISC-V “V” Vector Extension
inferred← citeshttps://doi.org/10.1016/j.future.2024.03.049openalex-snapshot
A new approach to Mergesort algorithm: Divide smart and conquer
inferred← citeshttps://doi.org/10.1109/ase63991.2025.00147openalex-snapshot
HybridSIMD: A Super C++ SIMD Library with Integrated Auto-tuning Capabilities
inferred← citeshttps://doi.org/10.1109/chilecon60335.2023.10418645openalex-snapshot
Parallel Block-InsertionSort
inferred← citeshttps://doi.org/10.1109/ciees66347.2025.11300064openalex-snapshot
Quick Sort for Real-Time Cybersecurity Analytics: Efficiency Gains, Implementation Risks, and Optimization Framework
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00195openalex-snapshot
F5: A Robust SIMD-Accelerated MSD Radix Sort
inferred← citeshttps://doi.org/10.1109/peccii70991.2026.11662093openalex-snapshot
MQI-Sort:A Multi-Strategy Adaptive Hybrid Sorting Framework for Robust and Scalable Data Ordering
inferred← citeshttps://doi.org/10.1145/3603719.3603731openalex-snapshot
LearnedSort as a learning-augmented SampleSort: Analysis and Parallelization
inferred← citeshttps://doi.org/10.15827/0236-235x.144.561openalex-snapshot
Создание инструментария для векторизации тела плоского цикла с помощью векторных инструкций AVX-512
inferred← citeshttps://doi.org/10.29007/lzksopenalex-snapshot
Minimizing Sorting Networks at the Sub-Comparator Level
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.