A tight threshold bound for search trees with 2-way comparisons

DOI10.1007/978-981-97-2340-9_9MaRDI QIDQ6636072zbMATH OpenFDO

Authors Sunny Atalig, Marek Chrobak

Publication date 12 November 2024

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• A Simple Algorithm for Optimal Search Trees with Two-way Comparisons
• On Huang and Wong's algorithm for generalized binary split trees
• Optimal search trees using two-way key comparisons
• Optimum binary search trees
• The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity
• Thresholds and optimal binary comparison search trees

This page was built for publication: A tight threshold bound for search trees with 2-way comparisons

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