Optimal Search Trees with 2-Way Comparisons

DOI10.1007/978-3-662-48971-0_7zbMath1472.68044arXiv1505.00357OpenAlexW816103523MaRDI QIDQ3459851

Neal E. Young, J. Ian Munro, Marek Chrobak, Mordecai J. Golin

Publication date: 11 January 2016

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.00357

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Data structures (68P05) Approximation algorithms (68W25)

Related Items (2)

On the cost of unsuccessful searches in search trees with two-way comparisons ⋮ On Huang and Wong's algorithm for generalized binary split trees

This page was built for publication: Optimal Search Trees with 2-Way Comparisons