Coping with errors in binary search procedures

R. L. Rivest, A. R. Meyer, D. J. Kleitman, K. Winklmann, J. Spencer

Research output: Contribution to journalArticle

Abstract

We consider the problem of identifying an unknown value x ε{lunate} {1, 2,..., n} using only comparisons of x to constants when as many as E of the comparisons may receive erroneous answers. For a continuous analogue of this problem we show that there is a unique strategy that is optimal in the worst case. This strategy for the continuous problem is then shown to yield a strategy for the original discrete problem that uses log2n + E · log2log2n + O(E · log2E) comparisons in the worst case. This number is shown to be optimal even if arbitrary "Yes-No" questions are allowed. We show that a modified version of this search problem with errors is equivalent to the problem of finding the minimal root of a set of increasing functions. The modified version is then also shown to be of complexity log2n + E · log2log2n + O(E · log2E).

Original languageEnglish (US)
Pages (from-to)396-404
Number of pages9
JournalJournal of Computer and System Sciences
Volume20
Issue number3
DOIs
StatePublished - 1980

Fingerprint

Binary search
Search Problems
Increasing Functions
Roots
Analogue
Unknown
Arbitrary
Strategy

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Coping with errors in binary search procedures. / Rivest, R. L.; Meyer, A. R.; Kleitman, D. J.; Winklmann, K.; Spencer, J.

In: Journal of Computer and System Sciences, Vol. 20, No. 3, 1980, p. 396-404.

Research output: Contribution to journalArticle

Rivest, R. L. ; Meyer, A. R. ; Kleitman, D. J. ; Winklmann, K. ; Spencer, J. / Coping with errors in binary search procedures. In: Journal of Computer and System Sciences. 1980 ; Vol. 20, No. 3. pp. 396-404.
@article{666214054b3e4ffc8a518600e5800d32,
title = "Coping with errors in binary search procedures",
abstract = "We consider the problem of identifying an unknown value x ε{lunate} {1, 2,..., n} using only comparisons of x to constants when as many as E of the comparisons may receive erroneous answers. For a continuous analogue of this problem we show that there is a unique strategy that is optimal in the worst case. This strategy for the continuous problem is then shown to yield a strategy for the original discrete problem that uses log2n + E · log2log2n + O(E · log2E) comparisons in the worst case. This number is shown to be optimal even if arbitrary {"}Yes-No{"} questions are allowed. We show that a modified version of this search problem with errors is equivalent to the problem of finding the minimal root of a set of increasing functions. The modified version is then also shown to be of complexity log2n + E · log2log2n + O(E · log2E).",
author = "Rivest, {R. L.} and Meyer, {A. R.} and Kleitman, {D. J.} and K. Winklmann and J. Spencer",
year = "1980",
doi = "10.1016/0022-0000(80)90014-8",
language = "English (US)",
volume = "20",
pages = "396--404",
journal = "Journal of Computer and System Sciences",
issn = "0022-0000",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - Coping with errors in binary search procedures

AU - Rivest, R. L.

AU - Meyer, A. R.

AU - Kleitman, D. J.

AU - Winklmann, K.

AU - Spencer, J.

PY - 1980

Y1 - 1980

N2 - We consider the problem of identifying an unknown value x ε{lunate} {1, 2,..., n} using only comparisons of x to constants when as many as E of the comparisons may receive erroneous answers. For a continuous analogue of this problem we show that there is a unique strategy that is optimal in the worst case. This strategy for the continuous problem is then shown to yield a strategy for the original discrete problem that uses log2n + E · log2log2n + O(E · log2E) comparisons in the worst case. This number is shown to be optimal even if arbitrary "Yes-No" questions are allowed. We show that a modified version of this search problem with errors is equivalent to the problem of finding the minimal root of a set of increasing functions. The modified version is then also shown to be of complexity log2n + E · log2log2n + O(E · log2E).

AB - We consider the problem of identifying an unknown value x ε{lunate} {1, 2,..., n} using only comparisons of x to constants when as many as E of the comparisons may receive erroneous answers. For a continuous analogue of this problem we show that there is a unique strategy that is optimal in the worst case. This strategy for the continuous problem is then shown to yield a strategy for the original discrete problem that uses log2n + E · log2log2n + O(E · log2E) comparisons in the worst case. This number is shown to be optimal even if arbitrary "Yes-No" questions are allowed. We show that a modified version of this search problem with errors is equivalent to the problem of finding the minimal root of a set of increasing functions. The modified version is then also shown to be of complexity log2n + E · log2log2n + O(E · log2E).

UR - http://www.scopus.com/inward/record.url?scp=0001328096&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0001328096&partnerID=8YFLogxK

U2 - 10.1016/0022-0000(80)90014-8

DO - 10.1016/0022-0000(80)90014-8

M3 - Article

AN - SCOPUS:0001328096

VL - 20

SP - 396

EP - 404

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

IS - 3

ER -