Optimal alphabetic trees for binary search

DOI10.1016/S0020-0190(98)00101-XzbMath1339.68061OpenAlexW2082860502MaRDI QIDQ293336

F. Blanchet-Sadri, M. Dambrine

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

zbMATH Keywords

analysis of algorithmsalphabetic treesbinary searchtwo-way comparison search

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Data structures (68P05)

Related Items (1)

Operations research applications of dichotomous search

Cites Work

• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Unnamed Item

This page was built for publication: Optimal alphabetic trees for binary search