Optimal multiway search trees for variable size keys

DOI10.1007/BF00289139MaRDI QIDQ1053461zbMATH OpenFDO

Authors Jayme L. Szwarcfiter

Publication date 1984

Published in Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

multiway search treesoptimal search treesvariable size keys

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• A new data structure for representing sorted lists
• Optimal Alphabetic Trees
• Optimal Binary Search Trees with Restricted Maximal Depth
• Optimal Multi-Way Search Trees
• Optimum binary search trees
• Optimum multiway search trees
• Organization and maintenance of large ordered indexes
• The construction of optimal multiway search trees and the monotonicity principle

Cited in

(1)

• Algorithms for a hashed file with variable-length records

This page was built for publication: Optimal multiway search trees for variable size keys

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1053461)