A tight threshold bound for search trees with 2-way comparisons
From MaRDI portal
Publication:6636072
DOI10.1007/978-981-97-2340-9_9MaRDI QIDQ6636072FDOQ6636072
Authors: Sunny Atalig, Marek Chrobak 
Publication date: 12 November 2024
Cites Work
- Title not available (Why is that?)
- Optimum binary search trees
- The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity
- Optimal search trees using two-way key comparisons
- Thresholds and optimal binary comparison search trees
- On Huang and Wong's algorithm for generalized binary split trees
- A Simple Algorithm for Optimal Search Trees with Two-way Comparisons
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)
