scientific article; zbMATH DE number 1524355

MaRDI QIDQ4512247zbMATH OpenFDO

Authors Ya. A. Kardash, G. G. Tsegelyk

Publication date 1 November 2000

zbMATH Keywords

minimal expectationoptimal probabilistic binary search tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimal binary search trees
• Assembling approximately optimal binary search trees efficiently using arithmetics
• Construction of optimal binary split trees in the presence of bounded access probabilities
• Faster construction of optimal binary split trees
• Optimal search trees using two-way key comparisons

Cited in

(5)

• A subquadratic algorithm for constructing approximately optimal binary search trees
• Assembling approximately optimal binary search trees efficiently using arithmetics
• scientific article; zbMATH DE number 1534563 (Why is no real title available?)
• Heuristics for optimum binary search trees and minimum weight triangulation problems
• Possibilistic search trees

This page was built for publication:

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