Generalized binary split trees

DOI10.1007/BF00289143MaRDI QIDQ794439zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 1984

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00289143

zbMATH Keywords

binary treesdata structurepolynomial time algorithmbinary split treesgeneralized split treesoptimal tree structures

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Recommendations

• Optimal multiway generalized split trees
• Optimal search trees using two-way key comparisons
• Optimal binary split trees
• Faster construction of optimal binary split trees
• Construction of optimal binary split trees in the presence of bounded access probabilities

Cites work

• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Median split trees
• Nearly optimal binary search trees
• Optimal binary split trees
• Optimum binary search trees
• The construction of optimal multiway search trees and the monotonicity principle

Cited in

(12)

• On the construction of weighted time-optimal B-trees
• Optimal binary split trees
• Classification via two-way comparisons (extended abstract)
• Optimal binary search trees
• Construction of optimal binary split trees in the presence of bounded access probabilities
• Faster construction of optimal binary split trees
• Optimal multiway split trees
• On the cost of unsuccessful searches in search trees with two-way comparisons
• Optimal search trees using two-way key comparisons
• scientific article; zbMATH DE number 7069635 (Why is no real title available?)
• On Huang and Wong's algorithm for generalized binary split trees
• Optimal multiway generalized split trees

This page was built for publication: Generalized binary split trees

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