On the public citation graph
Engineering In-place (Shared-memory) Sorting Algorithms
0 signed · 99 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.1002/(sici)1097-024x(199708)27:8<983::aid-spe117>3.0.co;2-#openalex-snapshot
Introspective Sorting and Selection Algorithms
inferredcites →https://doi.org/10.1002/spe.2922openalex-snapshot
Engineering faster sorters for small sets of items
inferredcites →https://doi.org/10.1007/11841036_69openalex-snapshot
How Branch Mispredictions Affect Quicksort
inferredcites →https://doi.org/10.1007/3-540-36574-5_8openalex-snapshot
Algorithms for Hardware Caches and TLB
inferredcites →https://doi.org/10.1007/978-3-319-67792-7_47openalex-snapshot
Even Faster Sorting of (Not Only) Integers
inferredcites →https://doi.org/10.1007/978-3-540-30140-0_69openalex-snapshot
Super Scalar Sample Sort
inferredcites →https://doi.org/10.1007/978-3-540-74466-5_72openalex-snapshot
MCSTL: The Multi-core Standard Template Library
inferredcites →https://doi.org/10.1007/978-3-540-79228-4_22openalex-snapshot
Ratio Based Stable In-Place Merging
inferredcites →https://doi.org/10.1007/978-3-642-23397-5_16openalex-snapshot
Engineering a Multi-core Radix Sort
inferredcites →https://doi.org/10.1007/978-3-642-30850-5_15openalex-snapshot
Branch Mispredictions Don’t Affect Mergesort
inferredcites →https://doi.org/10.1007/bf01937353openalex-snapshot
A generalized, one-way, stackless quicksort
inferredcites →https://doi.org/10.1007/bf01939369openalex-snapshot
A one-way, stackless quicksort algorithm
inferredcites →https://doi.org/10.1007/s00165-016-0401-3openalex-snapshot
Optimizing sorting algorithms by using sorting networks
inferredcites →https://doi.org/10.1007/s00453-002-0993-2openalex-snapshot
Scanning Multiple Sequences via Cache Memory
inferredcites →https://doi.org/10.1007/s00453-015-0071-1openalex-snapshot
Engineering Parallel String Sorting
inferredcites →https://doi.org/10.1007/s101070100263openalex-snapshot
Benchmarking optimization software with performance profiles
inferredcites →https://doi.org/10.1016/0020-0190(89)90116-6openalex-snapshot
A fast parallel quicksort algorithm
inferredcites →https://doi.org/10.1016/0167-8191(92)90089-popenalex-snapshot
A parallel partition for enhanced parallel QuickSort
inferredcites →https://doi.org/10.1093/comjnl/35.6.643openalex-snapshot
Fast Stable Merging and Sorting in Constant Extra Space
inferredcites →https://doi.org/10.1109/12.46289openalex-snapshot
Parallel Quicksort using fetch-and-add
inferredcites →https://doi.org/10.1109/12.88483openalex-snapshot
Time-space optimal parallel merging and sorting
inferredcites →https://doi.org/10.1109/empdp.2003.1183613openalex-snapshot
A simple, fast parallel implementation of Quicksort and its performance evaluation on SUN Enterprise 10000
inferredcites →https://doi.org/10.1137/1.9781611973198.6openalex-snapshot
Multi-Pivot Quicksort: Theory and Experiments
inferredcites →https://doi.org/10.1137/1.9781611975499.1openalex-snapshot
Worst-Case Efficient Sorting with QuickMergesort
inferredcites →https://doi.org/10.1137/1.9781611975499.2openalex-snapshot
Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme
inferredcites →https://doi.org/10.1145/1082036.1082037openalex-snapshot
An in-place sorting with O ( n log n ) comparisons and O ( n ) moves
inferredcites →https://doi.org/10.1145/113379.113380openalex-snapshot
A comparison of sorting algorithms for the connection machine CM-2
inferredcites →https://doi.org/10.1145/1227161.1227164openalex-snapshot
Engineering a cache-oblivious sorting algorithm
inferredcites →https://doi.org/10.1145/1378533.1378573openalex-snapshot
Fundamental parallel algorithms for private-cache chip multiprocessors
inferredcites →https://doi.org/10.1145/146370.146381openalex-snapshot
A survey of adaptive sorting algorithms
inferredcites →https://doi.org/10.1145/1810479.1810519openalex-snapshot
Low depth cache-oblivious algorithms
inferredcites →https://doi.org/10.1145/2588555.2610522openalex-snapshot
A comprehensive study of main-memory partitioning and its application to large-scale comparison- and radix-sort
inferredcites →https://doi.org/10.1145/2656337openalex-snapshot
On a Model of Virtual Address Translation
inferredcites →https://doi.org/10.1145/2755573.2755595openalex-snapshot
Practical Massively Parallel Sorting
inferredcites →https://doi.org/10.1145/320831.320833openalex-snapshot
Sorting on Electronic Computer Systems
inferredcites →https://doi.org/10.1145/321592.321600openalex-snapshot
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
inferredcites →https://doi.org/10.1145/3318464.3389752openalex-snapshot
The Case for a Learned Sorting Algorithm
inferredcites →https://doi.org/10.1145/3323165.3323198openalex-snapshot
Theoretically-Efficient and Practical Parallel In-Place Radix Sorting
inferredcites →https://doi.org/10.1145/3350755.3400254openalex-snapshot
ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines
inferredcites →https://doi.org/10.1145/3505286openalex-snapshot
Engineering In-place (Shared-memory) Sorting Algorithms
inferredcites →https://doi.org/10.1145/5666.5673openalex-snapshot
How not to lie with statistics: the correct way to summarize benchmark results
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.3138/fm57-6770-u75u-7727openalex-snapshot
ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE
inferredcites →https://doi.org/10.4230/lipics.esa.2016.38openalex-snapshot
BlockQuicksort: Avoiding Branch Mispredictions in Quicksort
inferredcites →https://doi.org/10.4230/lipics.esa.2017.9openalex-snapshot
In-Place Parallel Super Scalar Samplesort (IPSSSSo)
inferredcites →https://doi.org/10.48550/arxiv.1908.08111openalex-snapshot
Engineering Faster Sorters for Small Sets of Items
inferredcites →https://doi.org/10.48550/arxiv.2106.05123openalex-snapshot
Pattern-defeating Quicksort
inferredcites →https://doi.org/10.5445/ir/1000085031openalex-snapshot
Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools
inferredcites →https://doi.org/10.5555/982792.982833openalex-snapshot
Proximity Mergesort: optimal in-place sorting in the cache-oblivious model
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.3142openalex-snapshot
Vectorized and performance‐portable quicksort
inferred← citeshttps://doi.org/10.1007/978-3-031-21534-6_14openalex-snapshot
Scalable Text Index Construction
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-031-87639-4_2openalex-snapshot
The Holocron: Leveraging a Dynamic 3D Matrix for Efficient Data Storage and Retrieval in Strategic Management
inferred← citeshttps://doi.org/10.1007/978-981-99-1916-1_31openalex-snapshot
An Adaptive Replacement Strategy LWIRR for Shared Last Level Cache L3 in Multi-core Processors
inferred← citeshttps://doi.org/10.1007/s00453-025-01321-zopenalex-snapshot
ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
inferred← citeshttps://doi.org/10.1007/s10817-024-09701-wopenalex-snapshot
Refinement of Parallel Algorithms Down to LLVM: Applied to Practically Efficient Parallel Sorting
inferred← citeshttps://doi.org/10.1007/s11227-024-06031-xopenalex-snapshot
Split-bucket partition (SBP): a novel execution model for top-K and selection algorithms on GPUs
inferred← citeshttps://doi.org/10.1007/s42044-023-00151-yopenalex-snapshot
Minimum average case time complexity for sorting algorithms
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.1016/j.procs.2025.05.026openalex-snapshot
Performance Analysis of Efficient Sorting Algorithms in Big Data Processing
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.1038/s41598-026-46549-zopenalex-snapshot
Optimized N-deque partition dual-deque merge string sorting algorithm
inferred← citeshttps://doi.org/10.1109/access.2025.3549626openalex-snapshot
Fast, Robust, and Learned Distribution-Based Sorting
inferred← citeshttps://doi.org/10.1109/bigdata66926.2025.11402641openalex-snapshot
Typhoon: A Slice-Scrambled In-Place LSD Sort
inferred← citeshttps://doi.org/10.1109/chilecon60335.2023.10418645openalex-snapshot
Parallel Block-InsertionSort
inferred← citeshttps://doi.org/10.1109/hpec67600.2025.11196688openalex-snapshot
Performance Analysis of the Parallel Shared-Memory Sparse Matrix-Vector Multiplication on Unstructured Matrices
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00195openalex-snapshot
F5: A Robust SIMD-Accelerated MSD Radix Sort
inferred← citeshttps://doi.org/10.1109/ipdpsw71298.2026.00008openalex-snapshot
Raiders of the Lost Log: Synchronous Parallel In-Place Models and Algorithms
inferred← citeshttps://doi.org/10.1109/ispass55109.2022.00015openalex-snapshot
SAPCo Sort: Optimizing Degree-Ordering for Power-Law Graphs
inferred← citeshttps://doi.org/10.1134/s0032946024040069openalex-snapshot
Efficient In-Place Hough Transform Algorithm for Arbitrary Image Sizes
inferred← citeshttps://doi.org/10.1137/1.9781611977042.3openalex-snapshot
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence
inferred← citeshttps://doi.org/10.1137/1.9781611977561.ch14openalex-snapshot
PaCHash: Packed and Compressed Hash Tables
inferred← citeshttps://doi.org/10.1145/3558481.3591071openalex-snapshot
High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems
inferred← citeshttps://doi.org/10.1145/3603719.3603731openalex-snapshot
LearnedSort as a learning-augmented SampleSort: Analysis and Parallelization
inferred← citeshttps://doi.org/10.1145/3627535.3638483openalex-snapshot
Parallel Integer Sort: Theory and Practice
inferred← citeshttps://doi.org/10.1145/3639258openalex-snapshot
Grafite: Taming Adversarial Queries with Optimal Range Filters
inferred← citeshttps://doi.org/10.1145/3670684.3673403openalex-snapshot
Parallel Integer Sort: Theory and Practice (Abstract)
inferred← citeshttps://doi.org/10.1145/3673038.3673057openalex-snapshot
Parallel Iterative Mistake Minimization (IMM) clustering algorithm for shared-memory systems
inferred← citeshttps://doi.org/10.1145/3816891.3834845openalex-snapshot
Parallel Generation of Explanatory Decision Trees for K-means Clustering using OpenMP
inferred← citeshttps://doi.org/10.14778/3648160.3648185openalex-snapshot
Sorting on Byte-Addressable Storage: The Resurgence of Tree Structure
inferred← citeshttps://doi.org/10.21203/rs.3.rs-4226398/v1openalex-snapshot
Performance analysis of coalesce private or spill shared (CPOSS) replacement strategy overLRU to handle directory entry evictions from the slice last level cache (LLC) using a scalable coherent sparse directory in Multicore processor
inferred← citeshttps://doi.org/10.21248/gups.73935openalex-snapshot
Uniform sampling of simple graphs with prescribed degrees and experimental algorithms for external memory
inferred← citeshttps://doi.org/10.4230/lipics.esa.2026.15openalex-snapshot
Deconstructed "Learned" Indexes and Their Smoothed Analysis
inferred← citeshttps://doi.org/10.4230/lipics.sea.2022.4openalex-snapshot
Fast Succinct Retrieval and Approximate Membership Using Ribbon
inferred← citeshttps://doi.org/10.48550/arxiv.2012.14263openalex-snapshot
A fast probabilistic component-by-component construction of exactly integrating rank-1 lattices and applications
inferred← citeshttps://doi.org/10.55011/staiqc.2023.3101openalex-snapshot
Systematic Literature Review on Parallel Sorting and Searching Algorithms for Graph Analytics Problems
inferred← citeshttps://doi.org/10.5753/sbbd.2025.247290openalex-snapshot
Algoritmo Paralelo Eficiente para Ordenação Chave-Valor
showing the first 39 of 40 · page through all 40
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.