Optimal multiway search trees for variable size keys

DOI10.1007/BF00289139zbMath0517.68067MaRDI QIDQ1053461

Jayme Luiz 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)

Related Items (1)

Algorithms for a hashed file with variable-length records

Cites Work

• Unnamed Item
• Unnamed Item
• Optimum multiway search trees
• A new data structure for representing sorted lists
• Organization and maintenance of large ordered indexes
• Optimum binary search trees
• The construction of optimal multiway search trees and the monotonicity principle
• Optimal Multi-Way Search Trees
• Optimal Alphabetic Trees
• Optimal Binary Search Trees with Restricted Maximal Depth

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