fundamentals of algorithms from a distributed computing perspective. Basic

algorithmic problems like finding the maximum of a given set of numbers,

computing the minimum weight spanning tree of a graph etc look different

in the new model, and finding upper and lower bounds is challenging. The

talk aims to give a flavour of the reasoning involved.