On the public citation graph

Dynamic weighted binary search trees

https://doi.org/10.1007/bf00289093
0 signed · 23 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-08342-1_25openalex-snapshot
Dynamic Binary Search
inferredcites →https://doi.org/10.1007/bf00264289openalex-snapshot
Optimum binary search trees
inferredcites →https://doi.org/10.1007/bf00264563openalex-snapshot
Nearly optimal binary search trees
inferredcites →https://doi.org/10.1007/bf00289509openalex-snapshot
Symmetric binary B-Trees: Data structure and maintenance algorithms
inferredcites →https://doi.org/10.1137/0202005openalex-snapshot
Binary Search Trees of Bounded Balance
inferredcites →https://doi.org/10.1145/1499949.1500040openalex-snapshot
Weight-balanced trees
inferredcites →https://doi.org/10.1145/511285.511305openalex-snapshot
A balanced tree storage and retrieval algorithm
inferredcites →https://doi.org/10.1145/800116.803774openalex-snapshot
Two applications of a probabilistic search technique
inferredcites →https://doi.org/10.1145/800197.806043openalex-snapshot
Information retrieval
inferredcites →https://doi.org/10.1515/9783110826982openalex-snapshot
Angewandte Informatik

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-10291-4_16openalex-snapshot
The analysis of search trees: A survey
inferred← citeshttps://doi.org/10.1007/s00791-006-0019-8openalex-snapshot
A Poisson Integrator for Gaussian Wavepacket Dynamics
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90052-6openalex-snapshot
A subquadratic algorithm for constructing approximately optimal binary search trees
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50011-4openalex-snapshot
Data Structures
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00320-9openalex-snapshot
Optimal binary search trees
inferred← citeshttps://doi.org/10.1051/ita/1981150301831openalex-snapshot
Arbitrary weight changes in dynamic trees
inferred← citeshttps://doi.org/10.1137/0214041openalex-snapshot
Biased Search Trees
inferred← citeshttps://doi.org/10.1142/s0218195912600084openalex-snapshot
A STATIC OPTIMALITY TRANSFORMATION WITH APPLICATIONS TO PLANAR POINT LOCATION
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/1998196.1998200openalex-snapshot
A static optimality transformation with applications to planar point location
inferred← citeshttps://doi.org/10.1145/358476.358509openalex-snapshot
Balancing binary trees by internal path reduction
inferred← citeshttps://doi.org/10.22028/d291-26084openalex-snapshot
Arbitrary weight changes in dynamic trees
inferred← citeshttps://doi.org/10.5555/313852.313880openalex-snapshot
Sequential and parallel subquadratic work algorithms for constructing approximately optimal binary search trees
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.