On the public citation graph
Optimal Partitioning for Dual-Pivot Quicksort
0 signed · 35 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/978-3-642-33090-2_71openalex-snapshot
Average Case Analysis of Java 7’s 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.1137/1.9781611972931.5openalex-snapshot
Engineering Java 7's Dual Pivot Quicksort Using MaLiJAn
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.1142/8439openalex-snapshot
An Introduction to the Analysis of Algorithms
inferredcites →https://doi.org/10.1145/2629340openalex-snapshot
Average Case and Distributional Analysis of Dual-Pivot Quicksort
inferredcites →https://doi.org/10.1145/359619.359631openalex-snapshot
Implementing Quicksort programs
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.48550/arxiv.1303.5217openalex-snapshot
Optimal Partitioning for Dual-Pivot 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-031-21534-6_14openalex-snapshot
Scalable Text Index Construction
inferred← citeshttps://doi.org/10.1007/978-981-15-6648-6_26openalex-snapshot
Optimizing Complexity of Quick Sort
inferred← citeshttps://doi.org/10.1007/s00453-014-9953-xopenalex-snapshot
Analysis of Quickselect Under Yaroslavskiy’s Dual-Pivoting Algorithm
inferred← citeshttps://doi.org/10.1016/j.future.2017.01.034openalex-snapshot
Bidirectional Conditional Insertion Sort algorithm; An efficient progress on the classical insertion sort
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.2025.3564380openalex-snapshot
Cluster Sort: A Novel Hybrid Approach to Efficient In-Place Sorting Using Data Clustering
inferred← citeshttps://doi.org/10.1109/access.2025.3578331openalex-snapshot
Key Nodes Identification Method in Scale-Free Network Based on Structural Holes
inferred← citeshttps://doi.org/10.1109/icecce67514.2025.11257882openalex-snapshot
A Comparative Study of Quicksort Algorithm Variants: An Empirical Performance Analysis
inferred← citeshttps://doi.org/10.1109/iciset62123.2024.10939753openalex-snapshot
An Experimental Analysis on Different Pivot Selection Approaches for the Quicksort Algorithm
inferred← citeshttps://doi.org/10.1137/1.9781611973198.6openalex-snapshot
Multi-Pivot Quicksort: Theory and Experiments
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.1186/s42787-019-0004-2openalex-snapshot
Complexity analysis and performance of double hashing sort algorithm
inferred← citeshttps://doi.org/10.14569/ijacsa.2019.0101284openalex-snapshot
BulkSort: System Design and Parallel Hardware Implementation Considerations
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2536015/v1openalex-snapshot
Quicksort for Referenced Items
inferred← citeshttps://doi.org/10.31224/4537openalex-snapshot
Hybridization and Optimization Modeling, Analysis, and Comparative Study of Sorting Algorithms: Adaptive Techniques, Parallelization, for Mergesort, Heapsort, Quicksort, Insertion Sort, Selection Sort, and Bubble Sort
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.