Why a book on fault-tolerant search algorithms? Searching is one of the fundamental problems in computer science. Time and again algorithmic and combinatorial issues originally studied in the context
Dedicated to the memory of Rudolf Ahlswede, this Festschrift covers theory of games and strategic planning; combinatorial group testing and database mining; computational biology and string matching;
