Coping with errors in binary search procedures (Preliminary Report)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A compendium of key search references
ACM SIGIR Forum
The on-line d-dimensional dictionary problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
The complexity of searching a sorted array of strings
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A tight lower bound for searching a sorted array
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
ACM SIGACT News
ACM Transactions on Algorithms (TALG)
Optimal in-place sorting of vectors and records
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
The problem of searching for a given k-vector among a sorted list of n k-vectors is considered. The binary search is known to be optimal when k is 1. Here an almost optimal algorithm is presented for the 2-dimensional case. Interesting upper and lower bounds are derived for the general problem.