On the public citation graph

Deleting the root of a heap

https://doi.org/10.1007/bf00264353
0 signed · 25 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/bf01941462openalex-snapshot
Inserting a new element into a heap
inferredcites →https://doi.org/10.1007/bf02247934openalex-snapshot
Continuous models that are equivalent to randomness for the analysis of many sorting algorithms
inferredcites →https://doi.org/10.1017/9781009004091openalex-snapshot
A Course of Modern Analysis
inferredcites →https://doi.org/10.1109/sfcs.1980.38openalex-snapshot
Some observations on the average behavior of heapsort
inferredcites →https://doi.org/10.1137/1016082openalex-snapshot
Asymptotic Methods in Enumeration
inferredcites →https://doi.org/10.2307/2348852openalex-snapshot
Real and Complex Analysis.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118032886.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_1openalex-snapshot
An implicit binomial queue with constant insertion time
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/978-3-319-93725-0_4openalex-snapshot
Approche combinatoire
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_10openalex-snapshot
Distribution-Sensitive Binomial Queues
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_11openalex-snapshot
A Survey on Priority Queues
inferred← citeshttps://doi.org/10.1007/bf01937350openalex-snapshot
Average-case results on heapsort
inferred← citeshttps://doi.org/10.1007/bf01952680openalex-snapshot
A note on constructing min-max heaps
inferred← citeshttps://doi.org/10.1007/bf01955045openalex-snapshot
Recurrence Relations on Heaps
inferred← citeshttps://doi.org/10.1007/bf02247934openalex-snapshot
Continuous models that are equivalent to randomness for the analysis of many sorting algorithms
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/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.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-3975(95)00152-2openalex-snapshot
Heaps with bits
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/j.tcs.2003.09.001openalex-snapshot
ER modelling from first relational principles
inferred← citeshttps://doi.org/10.1109/32.29490openalex-snapshot
The external Heapsort
inferred← citeshttps://doi.org/10.1142/s0129054106004510openalex-snapshot
A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
inferred← citeshttps://doi.org/10.1145/235141.235145openalex-snapshot
The influence of caches on the performance of heaps
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.