On the public citation graph

Least upper bound on the cost of optimum binary search trees

0 signed · 15 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/bf00264289openalex-snapshot

Optimum binary search trees

inferredcites →https://doi.org/10.1137/0121057openalex-snapshot

Optimal Computer Search Trees and Variable-Length Alphabetical Codes

inferredcites →https://doi.org/10.1137/0122024openalex-snapshot

Path Length of Binary Search Trees

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-07407-4_4openalex-snapshot

Best possible bounds on the weighted path length of optimum binary search trees

inferred← citeshttps://doi.org/10.1007/3-540-57811-0_13openalex-snapshot

Efficient reorganization of binary search trees

inferred← citeshttps://doi.org/10.1007/978-3-031-82014-4_7openalex-snapshot

Old and New Results on Alphabetic Codes

inferred← citeshttps://doi.org/10.1007/bf00264563openalex-snapshot

Nearly optimal binary search trees

inferred← citeshttps://doi.org/10.1016/0012-365x(80)90153-3openalex-snapshot

Some results on Hu's conjecture concerning binary trees

inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00320-9openalex-snapshot

Optimal binary search trees

inferred← citeshttps://doi.org/10.1109/18.259659openalex-snapshot

Relative uniformity of sources and the comparison of optimal code costs

inferred← citeshttps://doi.org/10.1109/sequen.1997.666911openalex-snapshot

Code and parse trees for lossless source encoding

inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot

A compendium of key search references

inferred← citeshttps://doi.org/10.1145/3177540.3177563openalex-snapshot

Influence of Professor T. C. Hu's Works on Fundamental Approaches in Layout

inferred← citeshttps://doi.org/10.1590/s1519-69842008000500003openalex-snapshot

Hypotheses to explain the origin of species in Amazonia

inferred← citeshttps://doi.org/10.54254/2755-2721/31/20230171openalex-snapshot

Research on the fast geolocation algorithm based on Bloom filter

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.