The course will take place on Mondays 14:30-16:30 at Taub 201, and not as announced.

Credit points: 2.0

This course studies lower bounds and impossibility results for various problems (and models) in distributed computing. Emphasis will be placed on techniques, for example:

• Information-theoretic arguments

• Valency arguments

• Covering

• Topological and combinatorial methods

• Reductions

The course is based on a manuscript in preparation, by Hagit Attiya and Faith Ellen.