15 citations · 73 across the 25 of their papers we have counts for
Showing 2021 · cs.DSShow all
2 papers · 2 filters
cs.DS2021★ 4 cited
On the Cost of Unsuccessful Searches in Search Trees with Two-way Comparisons
Marek Chrobak, Mordecai Golin, J. Ian Munro +1
Search trees are commonly used to implement access operations to a set of stored keys. If this set is static and the probabilities of membership queries are known in advance, then…
cs.DS2021★ 8 cited
A Simple Algorithm for Optimal Search Trees with Two-Way Comparisons
Marek Chrobak, Mordecai Golin, J. Ian Munro +1
We present a simple -time algorithm for computing optimal search trees with two-way comparisons. The only previous solution to this problem, by Anderson et al., has the sam…