Distributed algorithms

The lecture series presented the ingredients of a theory of distributed algorithms. The lectures covered the notions of correctness of a distributed algorithm and revisited the notions of computability, universality and complexity in the distributed context. The lectures presented the most important results obtained in distributed algorithms over the last half-century, and highlighted the many problems still open. Most lectures were followed by a specialized seminar given by a leading international researcher in the field. The year ended with a symposium bringing together the best researchers in the field.