CSCI 2951-S
Distributed Computing through Combinatorial Topology
Spring 2016

Instructor: Maurice Herlihy
Location: CIT 477
Meeting Time: J: TTh 2:30-3:50

Updates

27 Feb Homework 1 out.

Homeworks

Homework 1 (due 4 March)
Homework 2 (due 15 March)
Homework 3 (due 4 April)
Homework 4 (due 26 April)

Papers for Student Presentations

7 April

Rental Harmony: Sperner'S Lemma in Fair Division

12 April

Unreliable Failure Detectors for Reliable Distributed Systems

Grading

Every two weeks, students will be assigned a set of exercises, most of which will be taken from the textbook. There will be 4 such homeworks.
Toward the end of the class, students will also be required to present one or more research papers (the exact number will depend on enrollment). Students are welcome to form teams of 2 or 3, but a team of k students must present k papers.
Each student will also do a final project consisting of a 10-page written report on a research paper (no teams).
The final grade will be based on 2/3 homeworks + 1/6 presentations + 1/6 final project.

Textbook:

Distributed Computing Through Combinatorial Topology

Tentative Calendar:

Collaboration Policy

You are encouraged to talk to one another about problems, homwork and otherwise, but everything you write and hand in must be your own work. Email your solution to mph@cs.brown.edu. Please submit a PDF file produced via LaTeX.