scientific article; zbMATH DE number 1524355

zbMATH Open0958.68128MaRDI QIDQ4512247FDOQ4512247

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

Publication date: 1 November 2000

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

minimal expectationoptimal probabilistic binary search tree

Mathematics Subject Classification ID

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

Cited In (5)

• A subquadratic algorithm for constructing approximately optimal binary search trees
• Assembling approximately optimal binary search trees efficiently using arithmetics
• Title not available (Why is that?)
• 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)