IEEE Transactions on Computers
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
Finding an optimal tree searching strategy in linear time
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Trees with exponentially growing costs
Information and Computation
Algorithms and theory of computation handbook
| Hi-index | 0.01 |