The presentations for EECS6117 will be given during the last few classes
of the term. Each student will pick a research paper on the theory of
distributed computing and give a 20-minute presentation on it.
The paper you choose must have a strong theoretical component.
(I.e., it should prove some theorems, not simply do experimental analysis.)
Good sources for papers include proceedings/issues of the following conferences/journals.
If you have a particular topic or interest in mind, I might be able to
help you find a relevant paper.
For the presentation, you should do the following, in order. Suggested timelines are shown.
- (by Mar 3) Select a paper and check with the instructor that it is an appropriate paper for presentation. As soon as you have done this, you can book a date for your presentation--the earlier you choose a paper, the more selection you will have for the date of presentation.
- (by Mar 15) Read the paper and meet with the instructor to discuss what parts of the paper you would like to present
- (by Mar 24) Prepare slides for your presentation. Slides should not be too full of text. Pictures are good. Pseudocode is very hard to present in a brief talk; it is better to communicate the ideas of algorithms in other ways.
- (by Mar 24) Meet with the instructor to go over the slides.
- (Mar 27-Apr 5) Present paper and give feedback on other students' presentations