- Abstract
-
Most distributed systems, in both real and artificial worlds, are inherently dynamic; that is, they evolve over time. Moreover, their typical evolution is characterized by the Complexity from Simplicity phenomenon: simple and local interaction rules among the system's nodes generate complex, self-organizing global behavior.
• Over the last decades, using the computational lens of distributed computing, an active theoretical research line has obtained significant results that have greatly increased our knowledge of such important phenomena. Furthermore, this research has allowed us to exploit these systems to perform important computational tasks in an efficient and resilient way.
• Within this framework, this talk will provide an overview of, and discuss, the research project our team started in 2008. This project focuses on the design and analysis of dynamics in evolving graphs, where the dynamics are simple and local interaction rules that can be applied by the nodes of a graph that evolves over time. - About the speaker
-
Andrea Clementi is a Full Professor of Computer Science at the University of Rome “Tor Vergata,” where he leads research in algorithmic theory, randomized and distributed methods, and dynamic communication networks. He obtained his PhD in Computer Science at Sapienza University of Rome, and has held collaborations and visiting positions at UC San Diego, the University of Geneva, and INRIA Sophia Antipolis. His research focuses on information spreading, consensus, opinion dynamics, and protocols over time-varying networks, and has appeared in top conferences and journals, including ACM-SIAM Symposium on Discrete Algorithms.