On the public citation graph

Three priority queue applications revisited

https://doi.org/10.1007/bf01758771
0 signed · 21 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/bf01840439openalex-snapshot
The pairing heap: A new form of self-adjusting heap
inferredcites →https://doi.org/10.1109/sfcs.1984.715934openalex-snapshot
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms
inferredcites →https://doi.org/10.1137/0205051openalex-snapshot
Finding Minimum Spanning Trees
inferredcites →https://doi.org/10.1137/0207026openalex-snapshot
Implementation and Analysis of Binomial Queue Algorithms
inferredcites →https://doi.org/10.1137/0215004openalex-snapshot
Self-Adjusting Heaps
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/359460.359478openalex-snapshot
A data structure for manipulating priority queues
inferredcites →https://doi.org/10.1145/3828.3835openalex-snapshot
Self-adjusting binary search trees
inferredcites →https://doi.org/10.1145/5684.5686openalex-snapshot
An empirical comparison of priority-queue and event-set implementations
inferredcites →https://doi.org/10.1145/800061.808752openalex-snapshot
Self-adjusting binary trees

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-49477-4_26openalex-snapshot
Randomized Meldable Priority Queues
inferred← citeshttps://doi.org/10.1007/3-540-61628-4_5openalex-snapshot
Functional data structures
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_59openalex-snapshot
Rank-Pairing Heaps
inferred← citeshttps://doi.org/10.1016/0010-4655(95)00120-2openalex-snapshot
An empirical assessment of priority queues in event-driven molecular dynamics simulation
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00194-8openalex-snapshot
A generalization of binomial queues
inferred← citeshttps://doi.org/10.1109/ftcs.1994.315646openalex-snapshot
Checking mergeable priority queues
inferred← citeshttps://doi.org/10.1137/100785351openalex-snapshot
Rank-Pairing Heaps
inferred← citeshttps://doi.org/10.1145/276698.276779openalex-snapshot
Information theoretic implications for pairing heaps
inferred← citeshttps://doi.org/10.1145/320211.320214openalex-snapshot
On the efficiency of pairing heaps and related data structures
inferred← citeshttps://doi.org/10.1145/351827.351828openalex-snapshot
Correspondence-based data structures for double-ended priority queues
inferred← citeshttps://doi.org/10.5445/ir/1000002042openalex-snapshot
Timetable information and shortest paths
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.