Article ID: | iaor20121110 |
Volume: | 32 |
Issue: | 4 |
Start Page Number: | 641 |
End Page Number: | 651 |
Publication Date: | Apr 2002 |
Journal: | Algorithmica |
Authors: | Ambainis , Bloch , Schweizer |
Keywords: | binary search |
We study the classic binary search problem, with a delay between query and answer. For all constant delays, we give matching upper and lower bounds on the number of queries.