This is a survey on searching with errors, considered in the framework of two-person games.
The Responder thinks of an object in the search space, and the Questioner has to find it by …

Extremal Finite Set Theory surveys old and new results in the area of extremal set system
theory. It presents an overview of the main techniques and tools (shifting, the cycle method …

The study of the effect that errors may have on computation started at the very beginning of
the history of computer science. It dates back to the early 1950s, to the research by von …

In the setting of error-correcting codes with feedback, Alice wishes to communicate ak-bit
message x to Bob by sending a sequence of bits over a channel while noiselessly receiving …

We consider the problem of searching for an unknown target vertex $ t $ in a (possibly edge-
weighted) graph. Each\emph {vertex-query} points to a vertex $ v $ and the response either …

Group testing is a search model which first appeared in the context of a biomedical
application, in the last years of the Second World War. It became clear that large amounts of …

In digital systems such as fiber optical communications, the ratio between probability of
errors of type 1→ 0 and 0→ 1 can be large. Practically, one can assume that only one type of …

In an error-correcting code, a sender encodes a message $ x\in\{0, 1\}^ k $ such that it is still
decodable by a receiver on the other end of a noisy channel. In the setting of\emph {error …

This work generalizes the binary search problem to a $ d $-dimensional domain $
S_1\times\cdots\times S_d $, where $ S_i=\{0, 1,\ldots, n_i-1\} $ and $ d\geq 1$, in the …

We consider the problem of searching for an unknown number in the search space U={0,...,
M-1}. q-ary questions can be asked and some of the answers may be wrong. An arbitrary …