On the public citation graph

Optimum multiway search trees

https://doi.org/10.1007/bf00288540
0 signed · 39 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/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.1016/0020-0190(76)90052-1openalex-snapshot
Optimal alphabetic search trees with restricted maximal height
inferredcites →https://doi.org/10.1080/00207168108803225openalex-snapshot
The construction of optimal multiway search trees and the monotonicity principle
inferredcites →https://doi.org/10.1093/comjnl/23.3.248openalex-snapshot
1-2 Brother Trees or AVL Trees Revisited
inferredcites →https://doi.org/10.1137/0121057openalex-snapshot
Optimal Computer Search Trees and Variable-Length Alphabetical Codes
inferredcites →https://doi.org/10.1137/0203008openalex-snapshot
Optimal Binary Search Trees with Restricted Maximal Depth
inferredcites →https://doi.org/10.1137/0205002openalex-snapshot
Optimal Alphabetic Trees
inferredcites →https://doi.org/10.1137/0206017openalex-snapshot
A Best Possible Bound for The Weighted Path Length of Binary Search Trees
inferredcites →https://doi.org/10.1137/0206045openalex-snapshot
A New Algorithm for Minimum Cost Binary Trees
inferredcites →https://doi.org/10.1137/0207037openalex-snapshot
Minimal-Comparison 2,3-Trees
inferredcites →https://doi.org/10.1137/0208004openalex-snapshot
Optimal 2,3-Trees
inferredcites →https://doi.org/10.1137/0210031openalex-snapshot
Optimal Multi-Way Search Trees
inferredcites →https://doi.org/10.1145/322092.322094openalex-snapshot
Self-Organizing Binary Search Trees
inferredcites →https://doi.org/10.1145/582095.582102openalex-snapshot
Compact B-trees
inferredcites →https://doi.org/10.1145/800116.803774openalex-snapshot
Two applications of a probabilistic search technique
inferredcites →https://doi.org/10.1184/r1/6605012openalex-snapshot
Dynamic programming in computer science

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/3-540-58218-5_5openalex-snapshot
A new algorithm for the construction of optimal B-trees
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_21openalex-snapshot
Efficient Construction of Near-Optimal Binary and Multiway Search Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_12openalex-snapshot
Should Static Search Trees Ever Be Unbalanced?
inferred← citeshttps://doi.org/10.1007/bf00289139openalex-snapshot
Optimal multiway search trees for variable size keys
inferred← citeshttps://doi.org/10.1007/bfb0017305openalex-snapshot
Dynamic k-dimensional multiway search under time-varying access frequencies
inferred← citeshttps://doi.org/10.1007/bfb0045096openalex-snapshot
Construction of nearly optimal multiway trees
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90099-0openalex-snapshot
A counter example to a monotonicity property of k-d trees
inferred← citeshttps://doi.org/10.1080/00207168108803225openalex-snapshot
The construction of optimal multiway search trees and the monotonicity principle
inferred← citeshttps://doi.org/10.1109/12.780881openalex-snapshot
Constructing optimal search trees in optimal time
inferred← citeshttps://doi.org/10.1109/43.905675openalex-snapshot
Alphabetic trees-theory and applications in layout-driven logic synthesis
inferred← citeshttps://doi.org/10.1109/tpami.1984.4767552openalex-snapshot
Picture Indexing and Abstraction Techniques for Pictorial Databases
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/1807085.1807125openalex-snapshot
Performance guarantees for B-trees with different-sized atomic keys
inferred← citeshttps://doi.org/10.1145/2907945openalex-snapshot
B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys
inferred← citeshttps://doi.org/10.4018/978-1-59904-887-1openalex-snapshot
Handbook of Research on Modern Systems Analysis and Design Technologies and Applications
inferred← citeshttps://doi.org/10.4018/978-1-59904-887-1.ch011openalex-snapshot
Strategies for Static Tables
inferred← citeshttps://doi.org/10.48550/arxiv.1006.3715openalex-snapshot
Should Static Search Trees Ever Be Unbalanced?
inferred← citeshttps://doi.org/10.48550/arxiv.1011.1337openalex-snapshot
Optimal Binary Search Trees with Near Minimal Height
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.