Course Identification

Title:

Distributed Graph Algorithms

Code:

20214122

Lecturers and Teaching Assistants

Lecturers:

Prof. Merav Parter

TA's:

Dr. Avi Cohen

Course Schedule and Location

Year:

2021

Semester:

Second Semester

When / Where:

Wednesday, 10:15 - 12:00, Jacob Ziskind Building, Rm 155

First Lecture:

24/03/2021

End date:

10/07/2021

Field of Study, Course Type and Credit Points

Mathematics and Computer Science: Lecture; Elective; Regular; 3.00 points

Comments

N/A

Prerequisites

No

Restrictions

Participants:

50

Language of Instruction

English

Attendance and participation

Expected and Recommended

Grade Type

Numerical (out of 100)

Grade Breakdown (in %)

Assignments:

40%

Final:

60%

Evaluation Type

Take-home exam

Scheduled date 1

Date / due date

N/A

Location

N/A

Time

-

Remarks

N/A

Estimated Weekly Independent Workload (in hours)

5

Syllabus

This course is a soft-merge of courses 20194061 and 20194122.

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.

Learning Outcomes

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.

Reading List

N/A

Website

N/A