The optimal binary search tree for Andersson's search algorithm

DOI10.1007/BF01210592MaRDI QIDQ1323348zbMATH OpenFDO

Authors David Spuler

Publication date 4 July 1994

Published in Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

search algorithmbinary search trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Optimal binary search trees
• Optimal binary search trees
• Optimal alphabetic trees for binary search
• An Approximation Algorithm for Binary Searching in Trees
• An approximation algorithm for binary searching in trees
• Optimal Search in Trees
• Binary search trees of almost optimal height
• Reflections on Optimal and Nearly Optimal Binary Search Trees
• DYNAMIC OPTIMAL BINARY SEARCH TREE
• scientific article; zbMATH DE number 5237331

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Optimum binary search trees
• The optimal binary search tree for Andersson's search algorithm

Cited in

(7)

• Thresholds and optimal binary comparison search trees
• Optimal alphabetic trees for binary search
• scientific article; zbMATH DE number 2081096 (Why is no real title available?)
• Optimal binary search trees
• The optimal binary search tree for Andersson's search algorithm
• A Simple Algorithm for Optimal Search Trees with Two-way Comparisons
• Operations research applications of dichotomous search

This page was built for publication: The optimal binary search tree for Andersson's search algorithm

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