Authors: Richard Beigel
Abstract: The unbounded search problem was posed by Bentley and Yao. It is the problem of finding a key in a linearly ordered unbounded table, with the proviso that the number of comparisons is to be minimized. We show that Bentley and Yao's lower bound is essentially optimal, and we prove some new upper bounds for the unbounded search problem. We show how to solve this problem in parallel as well.