scientific article; zbMATH DE number 2011834

MaRDI QIDQ4437486zbMATH OpenFDO

Authors Jayme L. Szwarcfiter

Publication date 2 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2653/26530002.htm

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Optimal binary search trees with costs depending on the access paths.
• Optimal binary search trees
• A subquadratic algorithm for constructing approximately optimal binary search trees
• Optimal search trees using two-way key comparisons
• On binary search trees

Cited in

(10)

• Optimal binary search trees with costs depending on the access paths.
• Cost-error relationships in A* tree-searching
• Reflections on Optimal and Nearly Optimal Binary Search Trees
• Optimal binary search trees
• The node visit cost of brother trees
• The cost of offline binary search tree algorithms and the complexity of the request sequence
• Heuristics for optimum binary search trees and minimum weight triangulation problems
• On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations
• Optimal Search Trees with 2-Way Comparisons
• scientific article; zbMATH DE number 5237331 (Why is no real title available?)

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 Q4437486)