On the public citation graph

Bounds for min-max heaps

https://doi.org/10.1007/bf01933726
0 signed · 24 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/bf00264229openalex-snapshot
An algorithm for merging heaps
inferredcites →https://doi.org/10.1007/bfb0012776openalex-snapshot
Heaps on heaps
inferredcites →https://doi.org/10.1145/322123.322128openalex-snapshot
A Counting Approach to Lower Bounds for Selection Problems
inferredcites →https://doi.org/10.1145/512274.3734138openalex-snapshot
Algorithm 232: Heapsort
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
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
inferredcites →https://doi.org/10.2307/3612485openalex-snapshot
Mathematical Spectrum

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-57155-8_257openalex-snapshot
The K-D heap: An efficient multi-dimensional priority queue
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_241openalex-snapshot
A framework for constructing heap-like structures in-place
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_9openalex-snapshot
Lipschitz Optimization
inferred← citeshttps://doi.org/10.1007/bf01096687openalex-snapshot
Finding maximum likelihood estimators for the three-parameter Weibull distribution
inferred← citeshttps://doi.org/10.1007/bf01179371openalex-snapshot
The relaxed min-max heap
inferred← citeshttps://doi.org/10.1007/bf01581202openalex-snapshot
Global optimization of univariate Lipschitz functions: I. Survey and properties
inferred← citeshttps://doi.org/10.1007/bf01581203openalex-snapshot
Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison
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/bfb0023822openalex-snapshot
Parallel complexity of heaps and min-max heaps
inferred← citeshttps://doi.org/10.1007/bfb0035161openalex-snapshot
Merging and splitting priority queues and deques in parallel
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90094-xopenalex-snapshot
A note on the construction of the data structure “deap”
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.12.008openalex-snapshot
Multidimensional heaps and complementary range searching
inferred← citeshttps://doi.org/10.1109/71.97899openalex-snapshot
Optimal parallel initialization algorithms for a class of priority queues
inferred← citeshttps://doi.org/10.1201/9781315119335-8openalex-snapshot
Double-Ended Priority Queues
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.