Showing papers by "Andrzej Pelc published in 1989"

TL;DR: This paper studies the problem of interactive searching in a set of numbers using comparison queries, under the assumption that each answer can be erroneous with a constant probability p and that a given reliability 0 2/3, O(logn) algorithms are given in each version of search.

TL;DR: The minimal number of yes-no queries sufficient to find an unknown integer between 1 and 2 m if at most two of the answers may be erroneous is determined.

TL;DR: Optimal winning strategies of the Questioner are studied and their lengths are compared to those about the minimal length of a k -error detecting code of given size.

TL;DR: A worst-case optimal algorithm of i-adaptive search is described and its complexity is determined, which turns out to be i·n1i where i may be a function of n.