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...
Main Author: | Cicalese, Ferdinando. (Author, http://id.loc.gov/vocabulary/relators/aut) |
---|---|
Corporate Author: | SpringerLink (Online service) |
Language: | English |
Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2013.
|
Edition: | 1st ed. 2013. |
Series: | Monographs in Theoretical Computer Science. An EATCS Series,
|
Subjects: | |
Online Access: | https://doi.org/10.1007/978-3-642-17327-1 |
Similar Items
-
An Introduction to Online Computation Determinism, Randomization, Advice / by Dennis Komm.
by: Komm, Dennis., et al.
Published: (2016) -
Fault-Tolerant Message-Passing Distributed Systems An Algorithmic Approach / by Michel Raynal.
by: Raynal, Michel., et al.
Published: (2018) -
Algoritmi Lo spirito dell'informatica / by David Harel, Yishai Feldman.
by: Harel, David., et al.
Published: (2008) -
Algorithmic Mathematics by Stefan Hougardy, Jens Vygen.
by: Hougardy, Stefan., et al.
Published: (2016) -
Computation and Logic in the Real World Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings / edited by Barry S. Cooper, Benedikt Löwe, Andrea Sorbi.
Published: (2007)