Abstract: Motivated by the need to understand the algorithmic foundations of distributed large-scale graph computations, we study some fundamental graph problems in a message-passing model for distributed computing. We present (almost) tight upper and lower bounds on the time complexity of several graph problems such as graph connectivity, minimum spanning tree, triangle enumeration, and PageRank. (Joint work with Gopal Pandurangan and Peter Robinson.)Biografia:Michele Scquizzato is a post-doctoral researcher in the Department of Computer Science at the University of Houston. His research focuses on the theory of parallel and distributed computing, algorithms for large-scale data analysis, and algorithmic problems related to energy-efficient computing. He received a Ph.D. in Information Engineering from the University of Padova in 2013