On the public citation graph

Bottom-up-heap sort, a new variant of heap sort beating on average quick sort (if n is not very small)

0 signed · 19 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00264353openalex-snapshot

Deleting the root of a heap

inferredcites →https://doi.org/10.1007/bf01937350openalex-snapshot

Average-case results on heapsort

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/0196-6774(89)90033-3openalex-snapshot

Building heaps fast

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.1093/comjnl/5.1.10openalex-snapshot

Quicksort

inferredcites →https://doi.org/10.1145/355588.365103openalex-snapshot

Algorithm 245: Treesort

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jagm.1998.0935openalex-snapshot

Quadripartite Sort

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/978-0-585-27330-3_6openalex-snapshot

Derivation of Randomized Sorting and Selection Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-658-01628-9_13openalex-snapshot

Bäume und Graphen

inferred← citeshttps://doi.org/10.1007/978-3-658-14634-4_13openalex-snapshot

Bäume und Graphen

inferred← citeshttps://doi.org/10.1007/978-3-658-30331-0_14openalex-snapshot

Datenstrukturen, Bäume und Graphen

inferred← citeshttps://doi.org/10.1007/978-3-658-41779-6_14openalex-snapshot

Datenstrukturen, Bäume und Graphen

inferred← citeshttps://doi.org/10.1007/bf01990520openalex-snapshot

Weak-heap sort

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.17485/ijst/2015/v8is8/71491openalex-snapshot

An Optimal Sorting Algorithm for Mobile Devices

inferred← citeshttps://doi.org/10.26483/ijarcs.v15i6.7152openalex-snapshot

Optimizing Heap Sort for Repeated Values: A Modified Approach to Improve Efficiency in Duplicate-Heavy Data Sets

inferred← citeshttps://doi.org/10.3844/jcssp.2009.476.478openalex-snapshot

Comparative Performance Study of Improved Heap Sort Algorithm on Different Hardware

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.