Michele Scquizzato: Distributed computation of large-scale graph problems
Time: Mon 2017-11-13 12.00
Location: Room 4523, Lindstedtsvägen 5, KTH CSC 
Participating: Michele Scquizzato, TCS Group, KTH
PRACTICALITIES
Lunch is served at 12:00 noon (register at the latest the Saturday before, but preferably earlier, at this doodle ). The presentation starts at 12:10 pm and ends at 1 pm. Those of us who wish reconvene after a short break for 1½-2 hours of more technical discussions.
ABSTRACT
As massive graphs become more prevalent, there is a rapidly growing need for scalable distributed algorithms that solve fundamental graph problems on large datasets. In this talk I will discuss some recent developments, highlighting some techniques to prove upper and lower bounds on the complexity of communication in distributed computations.