Thresholds and optimal binary comparison search trees

DOI10.1016/S0196-6774(02)00203-1zbMath1032.68067OpenAlexW2072336033MaRDI QIDQ4805400

No author found.

Publication date: 14 May 2003

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-6774(02)00203-1

zbMATH Keywords

split tree algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (3)

Classification via two-way comparisons (extended abstract) ⋮ 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: Thresholds and optimal binary comparison search trees