Course Identification

Title:

Advanced distributed algorithms

Code:

20194122

Lecturers and Teaching Assistants

Lecturers:

Prof. Merav Parter

TA's:

Dr. Avi Cohen

Course Schedule and Location

Year:

2019

Semester:

Second Semester

When / Where:

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

First Lecture:

28/03/2019

Field of Study, Course Type and Credit Points

Mathematics and Computer Science: Lecture; Elective; 2.00 points

Comments

N/A

Prerequisites

The course "Distributed Network Algorithms" by David Peleg in Semester A is a prerequisite to taking this course.

Restrictions

Participants:

50

Language of Instruction

English

Attendance and participation

Expected and Recommended

Grade Type

Numerical (out of 100)

Grade Breakdown (in %)

Assignments:

50%

Final:

50%

Evaluation Type

Final assignment

Scheduled date 1

Date / due date

N/A

Location

N/A

Time

-

Remarks

N/A

Estimated Weekly Independent Workload (in hours)

N/A

Syllabus

Randomized local algorithms and the shattering effect, deterministic local algorithms, the distributed Lovasz Local Lemma, complexity theory for local distributed graph problems, scheduling, communication-based lower bounds for global graph problems, proof labeling schemes, the congested clique model. If time allows, we will also discuss some relations to other models such as the centralized local models.

Learning Outcomes

Upon successful completion of the course the students will be able to:

Demonstrate familiarity with a diverse pool of tools: probabilistic
Provide a comprehensive description and explanation of recent research activity in the area of distributed graph algorithms.
Demonstrate an understanding of the connections to other areas such as streaming and communication complexity.

Reading List

N/A

Website

N/A