On the public citation graph
An algorithm for merging heaps
0 signed · 30 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.1038/scientificamerican0984-60openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1109/sfcs.1978.13openalex-snapshot
Description and analysis of an efficient priority queue representation
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/512274.512284openalex-snapshot
Algorithm 230: Matrix Permutation
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
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-52048-1_48openalex-snapshot
An efficient implicit data structure for path testing and searching in rooted trees and forests
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_257openalex-snapshot
The K-D heap: An efficient multi-dimensional priority queue
inferred← citeshttps://doi.org/10.1007/3-540-61422-2_150openalex-snapshot
Priority queues on parallel machines
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_11openalex-snapshot
A Survey on Priority Queues
inferred← citeshttps://doi.org/10.1007/bf01952680openalex-snapshot
A note on constructing min-max heaps
inferred← citeshttps://doi.org/10.1007/bf01990341openalex-snapshot
An efficient implicit data structure for relation testing and searching in partially ordered sets
inferred← citeshttps://doi.org/10.1007/bfb0035161openalex-snapshot
Merging and splitting priority queues and deques in parallel
inferred← citeshttps://doi.org/10.1007/bfb0035773openalex-snapshot
A pointer-free data structure for merging heaps and min-max heaps
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90262-zopenalex-snapshot
A pointer-free data structure for merging heaps and min-max heaps
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90026-eopenalex-snapshot
A characterization of heaps and its applications
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.1093/comjnl/38.10.818openalex-snapshot
An Efficient Construction Algorithm for a Class of Implicit 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.53846/goediss-6718openalex-snapshot
Chaotic Neural Circuit Dynamics
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.