Course Identification

Title:

Distributed Graph Algorithms

Code:

20234082

Lecturers and Teaching Assistants

Lecturers:

Prof. Merav Parter, Prof. David Peleg

TA's:

Orr Fischer

Course Schedule and Location

Year:

2023

Semester:

Second Semester

When / Where:

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

First Lecture:

19/04/2023

End date:

21/07/2023

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:

73

Language of Instruction

English

Attendance and participation

Required in at least 80% of the lectures

Grade Type

Numerical (out of 100)

Grade Breakdown (in %)

Assignments:

40%

Final:

60%

Evaluation Type

Examination

Scheduled date 1

Date / due date

26/07/2023

Location

Ziskind, Rm 1

Time

1000-1400

Remarks

N/A

Scheduled date 2

Date / due date

23/08/2023

Location

Ziskind, Rm 1

Time

1000-1400

Remarks

N/A

Estimated Weekly Independent Workload (in hours)

5

Syllabus

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