* Teacher: Linda Pagli, office hours: thursday 16-18, room 277/DE, Dept of Informatica
The goal of the course is to introduce the main algorithmic techniques in the framework of parallel and distributed models of computing; to define the most significant complexity parameters and the computational limits of parallelism and concurrency. Finally computational tools to design and analyze parallel and distributed algorithms are given.
Nicola Santoro. Design and Analysis of Distributed Algorithms, Whiley ed., 2007
Look also at the official website of the text book.
The slides of the lectures are available here. slides