On the public citation graph

Binary search trees of almost optimal height

https://doi.org/10.1007/bf01237235
0 signed · 32 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/3-540-19422-3_7openalex-snapshot
Priority search trees in secondary memory (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-52846-6_83openalex-snapshot
How to update a balanced binary tree with a constant number of rotations
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1007/bf00289509openalex-snapshot
Symmetric binary B-Trees: Data structure and maintenance algorithms
inferredcites →https://doi.org/10.1007/bf00289574openalex-snapshot
Stratified balanced search trees
inferredcites →https://doi.org/10.1007/bfb0014927openalex-snapshot
The Design of Dynamic Data Structures
inferredcites →https://doi.org/10.1016/0020-0190(76)90094-6openalex-snapshot
Implementing dictionaries using binary trees of very small height
inferredcites →https://doi.org/10.1016/0020-0190(83)90099-6openalex-snapshot
Updating a balanced search tree in O(1) rotations
inferredcites →https://doi.org/10.1038/scientificamerican0984-60openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1051/ita/1982160100511openalex-snapshot
A new class of balanced search trees : half-balanced binary search tress
inferredcites →https://doi.org/10.1093/comjnl/19.4.360openalex-snapshot
Algorithms supplement
inferredcites →https://doi.org/10.1109/sfcs.1978.3openalex-snapshot
A dichromatic framework for balanced trees
inferredcites →https://doi.org/10.1137/0202005openalex-snapshot
Binary Search Trees of Bounded Balance
inferredcites →https://doi.org/10.1137/0214021openalex-snapshot
Priority Search Trees
inferredcites →https://doi.org/10.1142/9789812791245openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1145/358105.358191openalex-snapshot
Efficient algorithms to globally balance a binary search tree
inferredcites →https://doi.org/10.1145/361254.361259openalex-snapshot
Optimizing binary trees grown with a sorting algorithm
inferredcites →https://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferredcites →https://doi.org/10.1145/6592.6599openalex-snapshot
Tree rebalancing in optimal time and space

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1998.0967openalex-snapshot
General Balanced Trees
inferred← citeshttps://doi.org/10.1007/3-540-36477-3_2openalex-snapshot
Combinatorial Auctions, an Example of Algorithm Theory in Real Life
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_6openalex-snapshot
The Complexity of Rebalancing a Binary Search Tree
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_10openalex-snapshot
Optimal bounds on the dictionary problem
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_83openalex-snapshot
How to update a balanced binary tree with a constant number of rotations
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_236openalex-snapshot
Balanced search trees made simple
inferred← citeshttps://doi.org/10.1007/3-540-61422-2_151openalex-snapshot
Binary search trees: How low can you go?
inferred← citeshttps://doi.org/10.1007/bfb0038193openalex-snapshot
Trees — a personal view
inferred← citeshttps://doi.org/10.1007/s00236-023-00452-6openalex-snapshot
Revisiting 2–3 red–black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00320-9openalex-snapshot
Optimal binary search trees
inferred← citeshttps://doi.org/10.1080/00207169108803956openalex-snapshot
Maintaining α-balanced trees by partial rebuilding
inferred← citeshttps://doi.org/10.21248/gups.62802openalex-snapshot
Some results on the theory and practice of algorithms
inferred← citeshttps://doi.org/10.5555/313559.313673openalex-snapshot
Confluently persistent deques via data structuaral bootstrapping
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.