On the public citation graph
Average-case results on heapsort
0 signed · 51 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-69672-5openalex-snapshot
Data Structures and Algorithms 1
inferredcites →https://doi.org/10.1007/bf01941462openalex-snapshot
Inserting a new element into a heap
inferredcites →https://doi.org/10.1016/0020-0190(87)90142-6openalex-snapshot
A variant of heapsort with almost optimal number of comparisons
inferredcites →https://doi.org/10.1016/s0019-9958(84)80053-4openalex-snapshot
An average case analysis of Floyd's algorithm to construct heaps
inferredcites →https://doi.org/10.1016/s0019-9958(84)80056-xopenalex-snapshot
The complexity of promise problems with applications to public-key cryptography
inferredcites →https://doi.org/10.1109/tse.1975.6312854openalex-snapshot
Random insertion into a priority queue structure
inferredcites →https://doi.org/10.1145/512274.512284openalex-snapshot
Algorithm 230: Matrix Permutation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_5openalex-snapshot
Two new algorithms for constructing min-max heaps
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_69openalex-snapshot
A tight lower bound for the worst case of Bottom-Up-Heapsort
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_241openalex-snapshot
A framework for constructing heap-like structures in-place
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_74openalex-snapshot
A meticulous analysis of mergesort programs
inferred← citeshttps://doi.org/10.1007/978-0-585-27330-3_6openalex-snapshot
Derivation of Randomized Sorting and Selection Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-0348-8211-8_18openalex-snapshot
On the Number of Heaps and the Cost of Heap Construction
inferred← citeshttps://doi.org/10.1007/978-3-642-23951-9_9openalex-snapshot
High-Speed High-Security Signatures
inferred← citeshttps://doi.org/10.1007/bf01182770openalex-snapshot
A tight lower bound for the worst case of Bottom-Up-Heapsort
inferred← citeshttps://doi.org/10.1007/bf01952680openalex-snapshot
A note on constructing min-max heaps
inferred← citeshttps://doi.org/10.1007/bf02238646openalex-snapshot
Best case lower bounds for Heapsort
inferred← citeshttps://doi.org/10.1007/bfb0015430openalex-snapshot
Heap construction: Optimal in both worst and average cases?
inferred← citeshttps://doi.org/10.1007/bfb0020794openalex-snapshot
The worst case complexity of MC Diarmid and Reed's variant of BOTTOM-UP-HEAT SORT is less than n log n+1.1n
inferred← citeshttps://doi.org/10.1007/bfb0023822openalex-snapshot
Parallel complexity of heaps and min-max heaps
inferred← citeshttps://doi.org/10.1007/bfb0029650openalex-snapshot
Bottom-up-heap sort, a new variant of heap sort beating on average quick sort (if n is not very small)
inferred← citeshttps://doi.org/10.1007/s13389-012-0027-1openalex-snapshot
High-speed high-security signatures
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90144-7openalex-snapshot
An optimal algorithm for deleting the root of a heap
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90027-vopenalex-snapshot
Average case analysis of heap building by repeated insertion
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/0890-5401(92)90005-zopenalex-snapshot
The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than n log n + 1.1n
inferred← citeshttps://doi.org/10.1016/s0898-1221(98)00158-8openalex-snapshot
3 is a more promising algorithmic parameter than 2
inferred← citeshttps://doi.org/10.1080/00207160008804896openalex-snapshot
A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort
inferred← citeshttps://doi.org/10.1080/00207160108805071openalex-snapshot
Sorting using heap structure
inferred← citeshttps://doi.org/10.1080/00207160500113272openalex-snapshot
Worst-case analysis of generalized heapsort algorithm revisited
inferred← citeshttps://doi.org/10.1080/207160310001599079openalex-snapshot
Improvements in double ended priority queues
inferred← citeshttps://doi.org/10.1090/s0025-5718-00-01219-9openalex-snapshot
Enumerating solutions to 𝑝(𝑎)+𝑞(𝑏)=𝑟(𝑐)+𝑠(𝑑)
inferred← citeshttps://doi.org/10.1093/nargab/lqae177openalex-snapshot
PyNetCor: a high-performance Python package for large-scale correlation analysis
inferred← citeshttps://doi.org/10.1109/taeece.2013.6557200openalex-snapshot
Bit-index sort: A fast non-comparison integer sorting algorithm for permutations
inferred← citeshttps://doi.org/10.1109/tim.2021.3051997openalex-snapshot
Subspace Dimension Reduction for Faster Multiple Signal Classification in Blade Tip Timing
inferred← citeshttps://doi.org/10.1287/mnsc.44.12.1709openalex-snapshot
Limit Theory for Performance Modeling of Future Event Set Algorithms
inferred← citeshttps://doi.org/10.31234/osf.io/yg9a6openalex-snapshot
Binary Path Sort: A Sorting Algorithm to Assess the Ranking Order of a Single Respondent
inferred← citeshttps://doi.org/10.31234/osf.io/yg9a6_v2openalex-snapshot
Binary Path Sort: A Sorting Algorithm to Assess the Ranking Order of a Single Respondent
inferred← citeshttps://doi.org/10.70675/4999d4b1z06acz442azbb82z5f9ccb92c33bopenalex-snapshot
Conjugate heat transfer coupling relying on large eddy simulation with complex geometries in massively parallel environments
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.