On the public citation graph
How Good Is Multi-Pivot Quicksort?
0 signed · 44 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.1006/jagm.1998.0985openalex-snapshot
The Influence of Caches on the Performance of Sorting
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-540-30140-0_69openalex-snapshot
Super Scalar Sample 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/978-3-642-33090-2_71openalex-snapshot
Average Case Analysis of Java 7’s Dual Pivot Quicksort
inferredcites →https://doi.org/10.1007/978-3-642-39206-1_4openalex-snapshot
Optimal Partitioning for Dual Pivot Quicksort
inferredcites →https://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
inferredcites →https://doi.org/10.1017/cbo9780511581274openalex-snapshot
Concentration of Measure for the Analysis of Randomized Algorithms
inferredcites →https://doi.org/10.1063/1.4822863openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science
inferredcites →https://doi.org/10.1080/02522667.2017.1303947openalex-snapshot
A note on multipivot Quicksort
inferredcites →https://doi.org/10.1137/0121057openalex-snapshot
Optimal Computer Search Trees and Variable-Length Alphabetical Codes
inferredcites →https://doi.org/10.1137/0206045openalex-snapshot
A New Algorithm for Minimum Cost Binary Trees
inferredcites →https://doi.org/10.1137/1.9780898716474openalex-snapshot
Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/1.9781611973198.6openalex-snapshot
Multi-Pivot Quicksort: Theory and Experiments
inferredcites →https://doi.org/10.1137/1.9781611973761.11openalex-snapshot
Analysis of Branch Misses in Quicksort
inferredcites →https://doi.org/10.1137/s0097539700382108openalex-snapshot
Optimal Sampling Strategies in Quicksort and Quickselect
inferredcites →https://doi.org/10.1145/2629340openalex-snapshot
Average Case and Distributional Analysis of Dual-Pivot Quicksort
inferredcites →https://doi.org/10.1145/2743020openalex-snapshot
Optimal Partitioning for Dual-Pivot Quicksort
inferredcites →https://doi.org/10.1145/321592.321600openalex-snapshot
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
inferredcites →https://doi.org/10.1145/362736.362753openalex-snapshot
Increasing the efficiency of quicksort
inferredcites →https://doi.org/10.1145/375827.375837openalex-snapshot
Improved master theorems for divide-and-conquer recurrences
inferredcites →https://doi.org/10.4230/lipics.esa.2016.38openalex-snapshot
BlockQuicksort: Avoiding Branch Mispredictions in Quicksort
inferredcites →https://doi.org/10.5555/314161.314321openalex-snapshot
Fast algorithms for sorting and searching strings
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.70673openalex-snapshot
PPQSort: Pattern‐Defeating Parallel Quicksort
inferred← citeshttps://doi.org/10.1007/978-981-15-6648-6_26openalex-snapshot
Optimizing Complexity of Quick Sort
inferred← citeshttps://doi.org/10.1007/978-981-96-4207-6_23openalex-snapshot
Out-of-Memory GPU Sorting Using Asynchronous CUDA Streams
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.1017/s096354831800041xopenalex-snapshot
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths
inferred← citeshttps://doi.org/10.1109/access.2022.3196006openalex-snapshot
Generating Almost Descending Sequences to Reduce the Number of Movements in Sorting
inferred← citeshttps://doi.org/10.1137/1.9781611975062.1openalex-snapshot
Probabilistic Analysis of the Dual-Pivot Quicksort “Count”
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/2967307.2967316openalex-snapshot
A Comparison of Sorting Times between Java 8 and Parallel Colt
inferred← citeshttps://doi.org/10.1515/itit-2018-0012openalex-snapshot
Dual-pivot and beyond: The potential of multiway partitioning in quicksort
inferred← citeshttps://doi.org/10.31648/ts.2714openalex-snapshot
Performance tests on merge sort and recursive merge sort for big data processing
inferred← citeshttps://doi.org/10.31648/ts.2908openalex-snapshot
Performance test on triple heap sort algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1604.06697openalex-snapshot
BlockQuicksort: How Branch Mispredictions don't affect Quicksort
inferred← citeshttps://doi.org/10.56979/401/2022/55openalex-snapshot
Preprocessing: A method For Reducing Time Complexity
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.