Optimal alphabetic trees for binary search
From MaRDI portal
Publication:293336
DOI10.1016/S0020-0190(98)00101-XzbMATH Open1339.68061OpenAlexW2082860502MaRDI QIDQ293336FDOQ293336
Authors: T. C. Hu, P. A. Tucker 
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S002001909800101X?np=y
Recommendations
- Optimal binary search trees
- Optimal binary search trees
- A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
- Optimal alphabetic binary tree for a nonregular cost function
- Algorithms – ESA 2005
- Optimal Computer Search Trees and Variable-Length Alphabetical Codes
- Binary search trees of almost optimal height
- Testing the optimality of alphabetic trees
- The optimal binary search tree for Andersson's search algorithm
- The Optimal Alphabetic Tree Problem Revisited
Cites Work
Cited In (12)
- Thresholds and optimal binary comparison search trees
- Binary Search on a Tape
- Title not available (Why is that?)
- Optimal binary search trees
- Upper and Lower Bounds on Constructing Alphabetic Binary Trees
- Binary search trees of almost optimal height
- The optimal binary search tree for Andersson's search algorithm
- On the cost of unsuccessful searches in search trees with two-way comparisons
- Operations research applications of dichotomous search
- Optimal search trees using two-way key comparisons
- Optimized binary search and text retrieval
- The Optimal Alphabetic Tree problem revisited
This page was built for publication: Optimal alphabetic trees for binary search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293336)
