## Moed B grades | |

Moed B grades have been published. The scans should be available soon. You may appeal until 5/10/2016, by sending me an email with a plaintext explanation of where you think you wrote a correct answer and I reduced points. Please do not include attachments. Please do not appeal about the number of points reduced for an incorrect answer. All appeals will be answered by 6/10/2016. If you were on reserve duty during one of the exams and would like to improve your grade, please contact me by 29/9/2016. Shana Tova! |

25/9/2016, 15:46:27 |

## Moed B | |

Moed B will take place on 20/9 at 9:00 in Taub 4. I will be available for questions on 19/9 and on the week before. I'm not scheduling a fixed office hour, so if you have questions please simply send me an email and we'll coordinate a time. Good luck! Keren |

4/9/2016, 10:48:36 |

## Moed B | |

Thanks for the responses, Moed B will take place as planned. Location and additional information will be published soon. |

21/8/2016, 08:20:47 |

## Moed B attendance - please respond | |

We need to know whether there are students that plan to attend Moed B. Please respond to uckerenatcs.technion.ac.il, whether you plan to attend Moed B or not. Please respond even if your answer is no. Notice that if all students indicate that they are not planning to attend then the exam will be cancelled (no room and supervisor will be allocated). Thanks, Keren |

18/8/2016, 12:10:07 |

## Moed A grades | |

Moed A grades have been published. The scans should be available soon. You may appeal until 14/7/2016, by sending me an email with a plaintext explanation of where you think you wrote a correct answer and I reduced points. Please do not include attachments. Please do not appeal about the number of points reduced for an incorrect answer. All appeals will be answered by 17/7/2016. Have a great summer! |

7/7/2016, 09:29:47 |

## HW3 graded | |

Dear students, The 3rd assignment has been graded. You may pick up your assignments from the secretaries. Please submit all appeals via email to Gregory by 03/07. Good luck in the exam! |

26/6/2016, 11:53:24 |

## Clarification about synchronizers | |

We assume that every synchronizer simulates a synchronous algorithm A round by round, by sending all original messages of A as well as ACKS. The rest of the messages that the synchronizer sends depend on its implementation. Therefore, the message overhead M of a synchronizer is the number of message sent per single round of the simulated algorithm A, EXCLUDING the messages of A themselves and the ACK messages. Notice that if we counted the ACK messages then every synchronizer might incur a message overhead that is at least the number of edges in the graph (in case in A all nodes send messages to all their neighbors), which would contradict the overheads we claimed for a tree-based synchronizer or a spanner-based synchronizer. |

26/6/2016, 11:29:47 |

## Office hour on Monday | |

I will hold an extra office hour on Monday 27/6 at 13:30. Keren |

26/6/2016, 11:21:57 |

## HW #2 grades published | |

Dear students, The grades for the second assignment are available online and the graded assignments are at the secretaries. You may submit appeals to Gregory via email until 22/06. |

15/6/2016, 13:51:19 |

## Additional material | |

For additional practice towards the exam, in the "Course Material" tab you can find questions from home assignments and a final (home) exam from a course given in Spring 2013. There is an overlap between the course of Spring 2013 and the current one but they are not entirely the same, so some questions may be irrelevant. Good luck! |

14/6/2016, 13:34:12 |

## HW #3 fix | |

In Q4 the assumption should be that each such spanner has strictly more than m edges. A revised file has been uploaded. |

6/6/2016, 14:05:43 |

## Home assignment 3 | |

Home assignment 3 is published. The due date is 22.6. This is the last assignment. Please submit electronically (preferred) or hand-written to Gregory's mailbox on the 5th floor. |

5/6/2016, 16:07:23 |

## HW #2 Clarification | |

Dear students, In question 2 you are expected to prove the correctness of your algorithms. There is no need to repeat proofs we've seen in class. |

24/5/2016, 15:48:15 |

## Home assignment 2 | |

Home assignment 2 is published. The due date is 1.6. Please submit electronically (preferred) or hand-written to Gregory's mailbox on the 5th floor. |

18/5/2016, 16:47:23 |

## HW #1 grades published | |

Dear students, The grades for the first assignment are available online. The graded papers will be available at the secretaries tomorrow at around noon. Please submit all appeals only via email to Gregory by May 9th. Attach a scan of the graded paper to your appeal. Some notes regarding the homework assignments: - One question from the HW assignments will appear on the test. Please make sure you know how to solve all of the questions that appear in the HW assignments. - Cite the sources you use. If your proof is based on a proof in a paper you need to mention this. - You may use all of what we learned in class without proving anything, unless you are explicitly asked to. - Please avoid using colors in electronically submitted papers. They are being printed in black and white. - Please write your name and id on the paper. |

1/5/2016, 15:49:31 |

## More pointers to course material | |

The lower bound for distributed MST we saw in class appears in: Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer: Distributed Verification and Hardness of Distributed Approximation. SIAM J. Comput. 41(5): 1235-1265 (2012) The lower bound on deterministic 2-party communication complexity of set-disjointness can be found in: Eyal Kushilevitz, Noam Nisan: Communication complexity. Cambridge University Press 1997, ISBN 978-0-521-56067-2, pp. I-XIII, 1-189 |

12/4/2016, 08:52:43 |

## HW1 Q1 clarification | |

The graph has n vertices, each has a unique id in {1,...,n^c}. |

3/4/2016, 18:53:15 |

## Home assignment 1 | |

Home assignment 1 is published. The due date is 20.4. Please submit electronically (preferred) or hand-written to Gregory's mailbox on the 5th floor. Note: Question 4 might be easier to solve after the next class. |

31/3/2016, 14:12:02 |

## Change of time for next week | |

As we set today in class, the class of Sunday 3.4 will instead be on Sunday 10.4 (at 16:30 in Taub 6). Next week there is no class. |

30/3/2016, 13:48:23 |

## Change of time for next week | |

The class on Wednesday 6.4 is cancelled. We will have a class on Sunday, 16:30 in Taub 6 instead. This is a one time change. Specifically, tomorrow the class takes place as usual. |

29/3/2016, 10:07:58 |

## A useful textbook | |

The following book has some overlap with the material of the course and should be available in the library: Distributed Computing: A Locality-Sensitive Approach, by David Peleg. |

24/3/2016, 11:49:42 |

## Welcome to Distributed Graph Algorithms | |

Please read the General Information tab for information about the syllabus and grade structure. See you in March, Keren |

10/1/2016, 16:27:26 |