Synopses & Reviews
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 of search find application in the most diverse areas of computer science and discrete mathematics. On the other hand, fault-tolerance is a necessary ingredient of computing.
This book examines approaches to fault-tolerance in the context of algorithmic search theory. It details the application of fault-tolerant search procedures to specific problems in distributed computing, bioinformatics and computational learning.
About the Author
The author received the award for the Best Italian Ph.D. thesis in Theoretical Computer Science, for work in this field, and he has since been awarded the Sofja Kovalevskaja Award of the Alexander von Humboldt Foundation and the German Federal Ministry of Research.
Table of Contents
Prologue.- Fault-Tolerant Search