Optimal Multi-Way Search Trees
From MaRDI portal
Publication:3911413
DOI10.1137/0210031zbMath0461.68069OpenAlexW1992695685MaRDI QIDQ3911413
Publication date: 1981
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0210031
Related Items
A new algorithm for the construction of optimal B-trees ⋮ Efficient Construction of Near-Optimal Binary and Multiway Search Trees ⋮ Algorithms for minimum length partitions of polygons ⋮ Optimal multiway generalized split trees ⋮ Operations research applications of dichotomous search ⋮ On the construction of weighted time-optimal B-trees ⋮ Self-adjusting multi-way search trees ⋮ On the Huffman and alphabetic tree problem with general cost functions ⋮ Heuristics for optimum binary search trees and minimum weight triangulation problems ⋮ Optimal multiway search trees for variable size keys ⋮ Monotonicity and efficient computation of optimal dichotomous search ⋮ A note on optimal multiway split trees
This page was built for publication: Optimal Multi-Way Search Trees