Distributed Graph Algorithms
Lecturers and Teaching Assistants
Prof. Merav Parter, Prof. David Peleg
Course Schedule and Location
Wednesday, 10:15 - 12:00, Ziskind, Rm 155
Field of Study, Course Type and Credit Points
Mathematics and Computer Science: Lecture; Elective; Regular; 3.00 points
Attendance and participation
Required in at least 80% of the lectures
Scheduled date 1
Scheduled date 2
Estimated Weekly Independent Workload (in hours)
We will cover a diverse collection of topics in the theory of distributed network algorithms. The material to be covered includes: local and global distributed graph algorithms, lower bounds techniques, distributed variants of the Lovasz Local Lemma, and basic principles of complexity theory for local distributed graph problems. If time allows, we will also discuss modern distributed models that have applications to big data analysis.
Upon successful completion of the course the students will be able to:
- Demonstrate familiarity with a diverse pool of tools: probabilistic analysis, lower bound techniques, etc.
- Provide a comprehensive presentation of the recent research activity in the area of distributed graph algorithms.