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: | |
|---|---|
| Corporate Author: | |
| 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 |
Table of Contents:
- Prologue
- Fault-Tolerant Search à la Ulam-Rényi
- Adaptive vs. Nonadaptive Search
- Weighted Errors Over a General Channel
- Variations on a Theme of Ulam and Rényi
- Time-outs
- Broadcast and Learning
- References
- Index.