---

Course: Fault Tolerant Algorithms

Time and place: Di 11-13 F0.530

Given by: Bogdan Chlebus, Room F2.201

The course will be taught in English.

A broad spectrum of algorithmic problems concerning computations resilient to errors will be presented.
The approach will be to show the diversity and scope rather than to select a few areas and cover them in depth.
Among the discussed topics will be the following:

Searching with a lie.

Noisy decision trees.

Fault tolerant broadcasting and gossiping.

Information dispersal.

Short overview of algebraic error-correcting codes.

Recent results on error-correcting codes.

Work-efficient reliable PRAM.

Synchronous time-efficient reliable PRAM.

Fault diagnosis.

Fault tolerance in general distributed computing.

Fault tolerance in specific synchronous networks.

The lectures will be primarily based on research papers.
Readable notes in a form suitable for copying will be distributed among the students.