On binary searching with non-uniform costs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A strategy for searching with different access costs
Theoretical Computer Science
Efficient Construction of Near-Optimal Binary and Multiway Search Trees
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Hi-index | 0.89 |