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
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |