Classification via two-way comparisons (extended abstract)

DOI10.1007/978-3-031-38906-1_19arXiv2302.09692OpenAlexW4385317303MaRDI QIDQ6179419

Marek Chrobak, Neal E. Young

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Generalized binary split trees
• Constructing optimal binary decision trees is NP-complete
• Optimal search trees using two-way key comparisons
• On the cost of unsuccessful searches in search trees with two-way comparisons
• On Huang and Wong's algorithm for generalized binary split trees
• Optimum binary search trees
• Optimal binary split trees
• Optimum split trees
• Faster construction of optimal binary split trees
• Median split trees
• Thresholds and optimal binary comparison search trees
• Twenty (simple) questions

This page was built for publication: Classification via two-way comparisons (extended abstract)