Nada

2D5340, Theoretical Distributed Computing, 4 poäng

Allmän kursbeskrivning

The course will survey basic problems and their solutions in the area of (theoretical) distributed computing. Algorithms, lower-bounds and impossibility results will be presented for basic problems in several models of distributed computation. During the course several challenging open problems will also be discussed.

Kursen är avsedd för doktorander och sistaårselever på D, E och F som är intresserade av teoretisk datalogi.

Kursledare är Alessandro Panconesi.

Kursen gick under period 4 96/97.

The lecture notes are now corrected and collected into a compendium.

Schedule

TimePlaceLecture notes
March 11, 10-12 Room 4618, Nada
March 12, 10-12 Room 4618, Nadanotes by Lars A
March 17, 13-15 Room 4618, Nadanotes by Lars E
March 19, 10-12 Room 4618, Nadanotes by Staffan
April 11, 10-12 Room 4618, Nada notes by Öjvind
April 14, 13-15nd Room 4618, Nada notes by Henrik
April 16, 10-12 Room 4618, Nada notes by Gunnar
April 21, 13-15 Room 4532, Nada notes by Lars A
April 23, 10-12 Room 4618, Nada notes by Karim
April 28, 13-15 Room 4618, Nada notes by Staffan
April 30, 10-12 Room 4618, Nada notes by Öjvind
April 30, 10-12 Room 4618, Nada
May 7, 13-15 Room 4618, Nada notes by Gunnar
May 12, 10-12 Room 4618, Nada notes by Lars E
May 14, 13-15 Room 4618, Nada

Home work sets

Homework 1
Homework 2
Homework 3
Homework 4
Homework 5
Final Exam

The result of the course evaluation is here.

^ Upp till kursöversikt.


Sidansvarig: <ale@nada.kth.se>
Senast ändrad 20 december 1997
Tekniskt stöd: <webmaster@nada.kth.se>