1 citations · 1 across the 4 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023
A Tight Threshold Bound for Search Trees with 2-way Comparisons
Sunny Atalig, Marek Chrobak
We study search trees with 2-way comparisons (2WCST's), which involve separate less-than and equal-to tests in their nodes, each test having two possible outcomes, yes and no. Thes…
cs.DS2023★ 1 cited
Structural Properties of Search Trees with 2-way Comparisons
Sunny Atalig, Marek Chrobak, Erfan Mousavian +2
Optimal 3-way comparison search trees (3WCST's) can be computed using standard dynamic programming in time O(n^3), and this can be further improved to O(n^2) by taking advantage of…