This course gives an introduction to distributed graph algorithms.
We will see various models of computation and the basic problems in this field.
We will study both algorithms and lower bounds.
This is an algorithmic/mathematical course.
There will be no final exam. The grade will be composed by 3-4 home assignments (submissions in singles) and a final project (submissions in pairs).
Prerequisits: Data Structures, Algorithms, and Introduction to Probability.
Computability Theory is "Tzamud".
No knowledge in distributed computing will be assumed.
The course is not a seminar and not a project course.
Registration is through the standard Technion system, not by email to the course staff.