On the public citation graph

Heaps on heaps

https://doi.org/10.1007/bfb0012776
0 signed · 16 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.1145/359460.359478openalex-snapshot
A data structure for manipulating priority queues
inferredcites →https://doi.org/10.1145/366622.366625openalex-snapshot
Letter to the editor
inferredcites →https://doi.org/10.1145/512274.3734138openalex-snapshot
Algorithm 232: Heapsort

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-45643-0_15openalex-snapshot
An Improvement on Tree Selection Sort
inferred← citeshttps://doi.org/10.1007/3-540-46521-9_13openalex-snapshot
QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms
inferred← citeshttps://doi.org/10.1007/bf00264229openalex-snapshot
An algorithm for merging heaps
inferred← citeshttps://doi.org/10.1007/bf01933726openalex-snapshot
Bounds for min-max heaps
inferred← citeshttps://doi.org/10.1007/bf01937350openalex-snapshot
Average-case results on heapsort
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90033-0openalex-snapshot
The deap—a double-ended heap to implement double-ended priority queues
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90142-6openalex-snapshot
A variant of heapsort with almost optimal number of comparisons
inferred← citeshttps://doi.org/10.1016/j.ins.2019.05.055openalex-snapshot
Efficient privacy-preserving data merging and skyline computation over multi-source encrypted data
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00288-2openalex-snapshot
QuickHeapsort, an efficient mix of classical sorting algorithms
inferred← citeshttps://doi.org/10.1080/207160310001599079openalex-snapshot
Improvements in double ended priority queues
inferred← citeshttps://doi.org/10.1145/6617.6621openalex-snapshot
Min-max heaps and generalized priority queues
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
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.