Fault-tolerant search algorithms reliable computation with unreliable information /

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. O...

Full description

Saved in:
Bibliographic Details
Main Author: Cicalese, Ferdinando (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint : Springer, [2013]
Series:Monographs in theoretical computer science.
Physical Description:
1 online resource (xv, 207 pages) : illustrations.
Subjects:
Fault-tolerant computing.
Computer science.
Information theory.
Algorithms.
Theory of computation.
Online Access:SpringerLink - Click here for access
Holdings details from CMU Electronic Access C502
Copy 1 CMU Electronic Access Available

Internet

SpringerLink - Click here for access

Similar Items