Optimal binary search trees with costs depending on the access paths

DOI10.1007/3-540-44849-7_2MaRDI QIDQ4437486zbMATH OpenFDO

Authors Jayme L. Szwarcfiter

Publication date 2 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2653/26530002.htm, http://hdl.handle.net/11422/2597

Mathematics Subject Classification ID

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

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

(11)

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

This page was built for publication: Optimal binary search trees with costs depending on the access paths

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