On the public citation graph
The analysis of Quicksort programs
0 signed · 138 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.1017/9781009260350.002openalex-snapshot
Algorithms+Data Structures = Programs
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0400642-2openalex-snapshot
Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth
inferredcites →https://doi.org/10.1145/321592.321600openalex-snapshot
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
inferredcites →https://doi.org/10.1145/356635.356640openalex-snapshot
Structured Programming with go to Statements
inferredcites →https://doi.org/10.1145/359619.359631openalex-snapshot
Implementing Quicksort programs
inferredcites →https://doi.org/10.1145/360860.360870openalex-snapshot
Some performance tests of ?quicksort? and descendants
inferredcites →https://doi.org/10.1145/362705.362710openalex-snapshot
Sorting in a paging environment
inferredcites →https://doi.org/10.1145/362736.362753openalex-snapshot
Increasing the efficiency of quicksort
inferredcites →https://doi.org/10.1145/362790.362803openalex-snapshot
Algorithms 402: Increasing the efficiency of quicksort
inferredcites →https://doi.org/10.1145/362875.362901openalex-snapshot
Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]
inferredcites →https://doi.org/10.2307/1266136openalex-snapshot
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
inferredcites →https://doi.org/10.2307/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ecjc.4430790304openalex-snapshot
Probabilistic analysis of the time complexity of quicksort
inferred← citeshttps://doi.org/10.1002/rsa.10010openalex-snapshot
On a multivariate contraction method for random recursive structures with applications to Quicksort
inferred← citeshttps://doi.org/10.1002/rsa.3240070403openalex-snapshot
Optimal sampling strategies for quicksort
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_42openalex-snapshot
A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_21openalex-snapshot
On the Performance of WEAK-HEAPSORT
inferred← citeshttps://doi.org/10.1007/978-1-4612-1690-2_3openalex-snapshot
Binary search trees based on Weyl and Lehmer sequences
inferred← citeshttps://doi.org/10.1007/978-1-4613-9464-8_12openalex-snapshot
Recent Results on the Average Time Behavior of Some Algorithms in Computational Geometry
inferred← citeshttps://doi.org/10.1007/978-3-0348-8211-8_20openalex-snapshot
Analysis of Quickfind with Small Subfiles
inferred← citeshttps://doi.org/10.1007/978-3-319-27436-2_8openalex-snapshot
Applying Sorting Networks to Synthesize Optimized Sorting Libraries
inferred← citeshttps://doi.org/10.1007/978-3-319-94821-8_12openalex-snapshot
Verified Analysis of Random Binary Tree Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_38openalex-snapshot
Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise
inferred← citeshttps://doi.org/10.1007/978-3-642-02444-3_16openalex-snapshot
A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_17openalex-snapshot
On Smoothed Analysis of Quicksort and Hoare’s Find
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-33090-2_71openalex-snapshot
Average Case Analysis of Java 7’s Dual Pivot Quicksort
inferred← citeshttps://doi.org/10.1007/978-94-015-9086-0_33openalex-snapshot
Some Inequalities Involving Harmonic Numbers
inferred← citeshttps://doi.org/10.1007/978-981-13-8222-2_27openalex-snapshot
An Experimental Study of a Modified Version of Quicksort
inferred← citeshttps://doi.org/10.1007/978-981-15-1480-7_33openalex-snapshot
Quicksort Algorithm—An Empirical Study
inferred← citeshttps://doi.org/10.1007/bf00996816openalex-snapshot
An efficient external sorting with minimal space requirement
inferred← citeshttps://doi.org/10.1007/bf01874394openalex-snapshot
The density function of the number of moves to complete the Towers of Hanoi puzzle
inferred← citeshttps://doi.org/10.1007/bf01874396openalex-snapshot
Randomized algorithms: An annotated bibliography
inferred← citeshttps://doi.org/10.1007/bf01934992openalex-snapshot
Analysis of the performance of the parallel quicksort method
inferred← citeshttps://doi.org/10.1007/bf02218438openalex-snapshot
Linear sorting withO(logn) processors
inferred← citeshttps://doi.org/10.1007/bf02679613openalex-snapshot
Transitional behaviors of the average cost of quicksort with median-of-(2t + 1)
inferred← citeshttps://doi.org/10.1007/bf02679621openalex-snapshot
On the analysis of stochastic divide and conquer algorithms
inferred← citeshttps://doi.org/10.1007/s00165-016-0401-3openalex-snapshot
Optimizing sorting algorithms by using sorting networks
inferred← citeshttps://doi.org/10.1007/s00170-003-1713-zopenalex-snapshot
Multi-nozzle spraying path generation directly from scanned data for rapid prototyping
inferred← citeshttps://doi.org/10.1007/s002360050103openalex-snapshot
An analysis and implementation of an efficient in-place bucket sort
inferred← citeshttps://doi.org/10.1007/s00453-011-9490-9openalex-snapshot
On Smoothed Analysis of Quicksort and Hoare’s Find
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.1007/s00453-015-0019-5openalex-snapshot
The Impact of Random Initialization on the Runtime of Randomized Search Heuristics
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/s00453-019-00634-0openalex-snapshot
QuickXsort: A Fast Sorting Scheme in Theory and Practice
inferred← citeshttps://doi.org/10.1007/s10817-020-09545-0openalex-snapshot
Verified Analysis of Random Binary Tree Structures
inferred← citeshttps://doi.org/10.1016/0020-0190(78)90028-5openalex-snapshot
Sorting by distributive partitioning
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90043-6openalex-snapshot
Sorting numbers in linear expected time and optimal extra space
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90067-9openalex-snapshot
A hybrid of quicksort with O(n log n) worst case complexity
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90118-1openalex-snapshot
Sorting a linked list with equal keys
inferred← citeshttps://doi.org/10.1016/0167-7152(94)00209-qopenalex-snapshot
Some properties of a limiting distribution in Quicksort
inferred← citeshttps://doi.org/10.1016/0196-6774(80)90003-6openalex-snapshot
An analysis of (h, k, 1)-Shellsort
inferred← citeshttps://doi.org/10.1016/0196-6774(81)90002-xopenalex-snapshot
Searching and sorting real numbers
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90364-yopenalex-snapshot
BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)
inferred← citeshttps://doi.org/10.1016/0304-4149(92)90035-oopenalex-snapshot
A fixed point theorem for distributions
inferred← citeshttps://doi.org/10.1016/0376-5075(84)90007-2openalex-snapshot
Sorting a distributed file in a network
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50010-4openalex-snapshot
Expected Time Analysis of Algorithms in Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50014-xopenalex-snapshot
Average-Case Analysis of Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1016/bs.adcom.2019.07.002openalex-snapshot
ALGator—An automatic algorithm evaluation system
inferred← citeshttps://doi.org/10.1016/j.future.2006.02.014openalex-snapshot
Sequential in-core sorting performance for a SQL data service and for parallel sorting on heterogeneous clusters
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.jda.2006.07.003openalex-snapshot
Asymptotic distributions for Random Median Quicksort
inferred← citeshttps://doi.org/10.1016/j.jspi.2023.106136openalex-snapshot
Optimal subsampling for the Cox proportional hazards model with massive survival data
inferred← citeshttps://doi.org/10.1016/j.phycom.2025.102846openalex-snapshot
Optimum aerial BS deployment for moving users based on quicksort and ZF-SIC techniques: Uplink and downlink scenarios
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.008openalex-snapshot
A divide-and-conquer approach for reconstruction of {C≥5}-free graphs via betweenness queries
inferred← citeshttps://doi.org/10.1016/s0007-8506(07)60786-0openalex-snapshot
Cost Decision Support in Product Design
inferred← citeshttps://doi.org/10.1016/s0166-3615(02)00038-6openalex-snapshot
Probe-radius compensation for 3D data points in reverse engineering
inferred← citeshttps://doi.org/10.1017/s0001867800004973openalex-snapshot
Analysis of swaps in radix selection
inferred← citeshttps://doi.org/10.1017/s0001867800011642openalex-snapshot
Density approximation and exact simulation of random variables that are solutions of fixed-point equations
inferred← citeshttps://doi.org/10.1051/ita/1989230303351openalex-snapshot
A limiting distribution for quicksort
inferred← citeshttps://doi.org/10.1051/ita/1991250100851openalex-snapshot
A limit theorem for “quicksort”
inferred← citeshttps://doi.org/10.1051/ita/1995290402551openalex-snapshot
Analysis of quickselect : an algorithm for order statistics
inferred← citeshttps://doi.org/10.1063/1.5047207openalex-snapshot
Reduced scaling Hilbert space variational Monte Carlo
inferred← citeshttps://doi.org/10.1080/00207168408803412openalex-snapshot
Parallel distributive partitioned sorting methods
inferred← citeshttps://doi.org/10.1088/1757-899x/180/1/012051openalex-snapshot
Multi-Pivot Quicksort: an Experiment with Single, Dual, Triple, Quad, and Penta-Pivot Quicksort Algorithms in Python
inferred← citeshttps://doi.org/10.1090/s0025-5718-1990-1023769-6openalex-snapshot
Some identities involving harmonic numbers
inferred← citeshttps://doi.org/10.1109/icpp.2016.49openalex-snapshot
DC-Top-k: A Novel Top-k Selecting Algorithm and Its Parallelization
inferred← citeshttps://doi.org/10.1109/informatics.2017.8327225openalex-snapshot
Estimating the time complexity of the algorithms by counting the Java bytecode instructions
inferred← citeshttps://doi.org/10.1109/tmc.2020.2983924openalex-snapshot
Distributed Online Learning of Cooperative Caching in Edge Cloud
inferred← citeshttps://doi.org/10.1137/1.9781611973198.6openalex-snapshot
Multi-Pivot Quicksort: Theory and Experiments
inferred← citeshttps://doi.org/10.1137/1.9781611974775.13openalex-snapshot
Partial Match Queries in Relaxed K-dt trees
inferred← citeshttps://doi.org/10.1137/1.9781611975062.2openalex-snapshot
Quicksort Is Optimal For Many Equal Keys
inferred← citeshttps://doi.org/10.1137/s0097539700382108openalex-snapshot
Optimal Sampling Strategies in Quicksort and Quickselect
inferred← citeshttps://doi.org/10.1145/109025.109100openalex-snapshot
Implementing partition on vector computers
inferred← citeshttps://doi.org/10.1145/1227161.1402294openalex-snapshot
On the adaptiveness of Quicksort
inferred← citeshttps://doi.org/10.1145/174130.174132openalex-snapshot
Randomized algorithms and pseudorandom numbers
inferred← citeshttps://doi.org/10.1145/2576768.2598359openalex-snapshot
The impact of random initialization on the runtime of randomized search heuristics
inferred← citeshttps://doi.org/10.1145/2629340openalex-snapshot
Average Case and Distributional Analysis of Dual-Pivot Quicksort
inferred← citeshttps://doi.org/10.1145/308386.308458openalex-snapshot
Stable set and multiset operations in optimal time and space
inferred← citeshttps://doi.org/10.1145/351827.384257openalex-snapshot
Performance engineering case study
inferred← citeshttps://doi.org/10.1145/356707.356711openalex-snapshot
A Survey of Analysis Techniques for Discrete Algorithms
inferred← citeshttps://doi.org/10.1145/358105.1387109openalex-snapshot
Technical Correspondence—MEANSORT (April 1983)
inferred← citeshttps://doi.org/10.1145/359619.359631openalex-snapshot
Implementing Quicksort programs
inferred← citeshttps://doi.org/10.1145/3816707openalex-snapshot
Tony Hoare: his path to the ACM Turing Award
inferred← citeshttps://doi.org/10.1145/62212.62242openalex-snapshot
Randomized algorithms and pseudorandom numbers
inferred← citeshttps://doi.org/10.1287/ijoc.12.1.24.11899openalex-snapshot
Statistical Analysis of Computational Tests of Algorithms and Heuristics
inferred← citeshttps://doi.org/10.1287/ijoc.8.3.318openalex-snapshot
Use of Representative Operation Counts in Computational Testing of Algorithms
inferred← citeshttps://doi.org/10.1287/opre.26.5.686openalex-snapshot
Data Structures and Computer Science Techniques in Operations Research
inferred← citeshttps://doi.org/10.14257/ijhit.2017.10.7.03openalex-snapshot
Binomial Heap Sorting – A New Sorting Algorithm
inferred← citeshttps://doi.org/10.15546/aeei-2018-0028openalex-snapshot
JAVA BYTECODE INSTRUCTION USAGE COUNTING WITH ALGATOR
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2705092/v1openalex-snapshot
Skip (Insertion) Sort, Skip List Based New and Very Efficient Sorting Algorithm
inferred← citeshttps://doi.org/10.2991/ammsa-17.2017.21openalex-snapshot
The Genome Assembly Model for Next-Generation Sequencing Data
inferred← citeshttps://doi.org/10.31449/inf.v43i1.2674openalex-snapshot
Implementation and Evaluation of Algorithms with ALGator
inferred← citeshttps://doi.org/10.36227/techrxiv.23612247openalex-snapshot
Energy Cost Conservation for Collaborative Edge Clouds with Online Mini-Batch Learning
inferred← citeshttps://doi.org/10.36227/techrxiv.23612247.v1openalex-snapshot
Energy Cost Conservation for Collaborative Edge Clouds with Online Mini-Batch Learning
inferred← citeshttps://doi.org/10.4156/jdcta.vol4.issue8.21openalex-snapshot
Several Incomplete Sort Algorithms for Getting the Median Value
inferred← citeshttps://doi.org/10.46298/dmtcs.369openalex-snapshot
A survey of multivariate aspects of the contraction method
inferred← citeshttps://doi.org/10.48550/arxiv.0904.3898openalex-snapshot
On Smoothed Analysis of Quicksort and Hoare's Find
inferred← citeshttps://doi.org/10.48550/arxiv.0910.3835openalex-snapshot
On the asymptotics of moments of linear random recurrences
inferred← citeshttps://doi.org/10.48550/arxiv.1403.6602openalex-snapshot
Pivot Sampling in Dual-Pivot Quicksort
inferred← citeshttps://doi.org/10.48550/arxiv.1505.00558openalex-snapshot
Triple State QuickSort, A replacement for the C/C++ library qsort
inferred← citeshttps://doi.org/10.48550/arxiv.1904.04690openalex-snapshot
Guidelines for Experimental Algorithmics in Network Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.1906.05384openalex-snapshot
Loop Programming Practices that Simplify Quicksort Implementations
inferred← citeshttps://doi.org/10.5206/mt.v3i2.15664openalex-snapshot
Analysis of algorithms as a teaching experience
inferred← citeshttps://doi.org/10.5555/314161.314321openalex-snapshot
Fast algorithms for sorting and searching strings
inferred← citeshttps://doi.org/10.7146/brics.v11i27.21852openalex-snapshot
On the Adaptiveness of Quicksort
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.