On the public citation graph
Improving time and space efficiency in generalized binary search trees
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.
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/bf00263927openalex-snapshot
Storage utilization in B *-trees with a generalized overflow technique
inferredcites →https://doi.org/10.1016/0196-6774(85)90003-3openalex-snapshot
The analysis of a fringe heuristic for binary search trees
inferredcites →https://doi.org/10.1016/s0019-9958(82)90534-4openalex-snapshot
The theory of fringe analysis and its application to 23 trees and b-trees
inferredcites →https://doi.org/10.1093/comjnl/19.4.322openalex-snapshot
Locally balanced binary trees
inferredcites →https://doi.org/10.1137/0202005openalex-snapshot
Binary Search Trees of Bounded Balance
inferredcites →https://doi.org/10.1145/358476.358509openalex-snapshot
Balancing binary trees by internal path reduction
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.10005openalex-snapshot
Phase changes in random m ‐ary search trees and generalized quicksort
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_4openalex-snapshot
Analysis of kdt-trees: Kd-trees improved by local reorganisations
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_17openalex-snapshot
Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization
inferred← citeshttps://doi.org/10.1007/bf01179372openalex-snapshot
The analysis of heuristics for search trees
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90007-oopenalex-snapshot
Fringe analysis for Extquick: Anin situ distributive external sorting algorithm
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00184-1openalex-snapshot
On rotations in fringe-balanced binary trees
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00208-0openalex-snapshot
An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00320-9openalex-snapshot
Optimal binary search trees
inferred← citeshttps://doi.org/10.1017/s026996480000084xopenalex-snapshot
Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
inferred← citeshttps://doi.org/10.1109/hicss.1989.49231openalex-snapshot
An economic framework for computing
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
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.