This book presents a guide to the extensive literature on the topic of semirings and includes
a complete bibliography. It serves as a complement to the existing monographs and a point …

Group testing has been used in medical, chemical and electrical testing, coding, drug
screening, pollution control, multiaccess channel management, and recently in data …

We state and analyze the first active learning algorithm which works in the presence of
arbitrary forms of noise. The algorithm, A 2 (for Agnostic Active), relies only upon the …

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 …

Roughly speaking, the family of combinatorial games consists of two-player games with
perfect information (no hidden information as in some card games), no chance moves (no …

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 …

Ulam’s searching game with a fixed number of lies Page 1 Theoretical Computer Science 95
(1992) 307-321 Elsevier 307 Mathematical Games Ulam’s searching game with a fixed …

We determine the minimal number of yes-no queries sufficient to find an unknown integer
between 1 and n if at most two of the answers may be erroneous. This solves completely the …

In applications such as active learning and disease/fault diagnosis, one often encounters the
problem of identifying an unknown object through a minimal number of queries. This …

Letft (n) be the number of questions necessary to find an unknown element out of a set
ofnelements with aq-ary search process when up totanswers may be wrong (are lies). Forq …