Seminario: “Distributed Algorithms for Large-Scale Graphs and Networks”

Mercoledì 6 Marzo 2019, ore 16:15 - Aula 1BC45 - Michele Scquizzato


Mercoledì 6 Marzo 2019 alle ore 16:15 in Aula 1BC45, Michele Scquizzato terrà un seminario dal titolo “Distributed Algorithms for Large-Scale Graphs and Networks”.

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 algorithmic developments and some open problems in these two contexts, highlighting the commonalities between them.

Short Bio
Since 2019, Michele Scquizzato is an assistant professor (RTD/a) at the Department of Mathematics, University of Padova. He has been post-doctoral researcher at the University of Pittsburgh (2013-2014), at the University of Houston (2014-2017), and at the KTH Royal Institute of Technology (2017-2018).