On the public citation graph
The relaxed min-max heap
0 signed · 29 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.1007/bf01840439openalex-snapshot
The pairing heap: A new form of self-adjusting heap
inferredcites →https://doi.org/10.1016/0020-0190(87)90033-0openalex-snapshot
The deap—a double-ended heap to implement double-ended priority queues
inferredcites →https://doi.org/10.1016/0304-3975(91)90262-zopenalex-snapshot
A pointer-free data structure for merging heaps and min-max heaps
inferredcites →https://doi.org/10.1093/comjnl/34.5.423openalex-snapshot
A Mergeable Double-ended Priority Queue
inferredcites →https://doi.org/10.1137/0207026openalex-snapshot
Implementation and Analysis of Binomial Queue Algorithms
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/359460.359478openalex-snapshot
A data structure for manipulating priority queues
inferredcites →https://doi.org/10.1145/50087.50096openalex-snapshot
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
inferredcites →https://doi.org/10.1145/512274.512284openalex-snapshot
Algorithm 230: Matrix Permutation
inferredcites →https://doi.org/10.1145/6617.6621openalex-snapshot
Min-max heaps and generalized priority queues
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.6338openalex-snapshot
Pre‐filtering based summarization for data partitioning in distributed stream processing
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-60220-8_70openalex-snapshot
Fast meldable priority 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/s00607-008-0019-2openalex-snapshot
Two new methods for constructing double-ended priority queues from priority queues
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.12.008openalex-snapshot
Multidimensional heaps and complementary range searching
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00501-xopenalex-snapshot
Reflected min-max heaps
inferred← citeshttps://doi.org/10.1016/s0898-1221(01)00331-5openalex-snapshot
The bounds of min-max pair heap construction
inferred← citeshttps://doi.org/10.1080/207160310001599079openalex-snapshot
Improvements in double ended priority queues
inferred← citeshttps://doi.org/10.1109/istcs.1995.377045openalex-snapshot
A general technique for implementation of efficient priority queues
inferred← citeshttps://doi.org/10.1145/968280.968296openalex-snapshot
Incremental physical resynthesis for timing optimization
inferred← citeshttps://doi.org/10.12737/article_59353e29dbe730.65834739openalex-snapshot
ASSESSMENT OF MULTIDIMENSIONAL PYRAMID EFFICIENCY
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.