29 gennaio 2021 ore 15:30 - 16:30
Aula Luiss Research Seminars, Sede di Luiss
Speaker: Michele Scquizzato, Università di Padova
As massive graphs become more prevalent, there is a rapidly growing need for scalable distributed algorithms that solve fundamental graph problems on very large datasets. At the same time, large distributed networks such as the Internet, sensor networks, ad hoc wireless networks, and the IoT are becoming ubiquitous, increasing the need for scalable network algorithms that provide basic primitives. In this talk I will discuss some recent developments in these two contexts, highlighting the commonalities between them.