30th Anniversary of SIROCCO

Pierluigi Crescenzi is a professor at the Gran Sasso Science Institute. Before joining GSSI, he has been researcher at the University of L’Aquila, and professor at the University of Rome, Florence, and Paris. He has taught in basically every field of computer science. He is the author of approximately 140 scientific publications in the field of algorithm theory and its applications. He is co-author of 5 university textbooks, including 2 in English, and a popular Italian book. He is member of the editorial board of JCSS. He is co-author of the NP optimisation compendium, which is still widely cited. His current research is mostly focus on the analysis of complex networks and, more specifically, of temporal networks.

Pierre Fraigniaud is CNRS researcher, member of Institut de Recherche en Informatique Fondamentale (IRIF), affiliated to both Université Paris Cité and CNRS. He got his PhD degree in Computer Science from ENS Lyon in 1990. His main research interest is parallel and distributed computing, and specifically the design and analysis of distributed algorithms for networks, with recent interests in fault-tolerant algorithms for asynchronous shared memory systems, using tools from algebraic topology. He is member of the Editorial Boards of Distributed Computing, Theory of Computing Systems, and Information and Computation. He was program committee chair of FUN 2022, IPDPS 2017 (Track Algorithms), ICALP 2014 (Track C), PODC 2011, DISC 2005, SPAA 2001, and EuroPar 1996.

Rotem Oshman is an Associate Professor in the Computer Science Department of Tel Aviv University. She received her BA and her MSc from the Technion, and her PhD from MIT. Prior to joining Tel Aviv University, she was a post-doctoral research fellow at the University of Toronto and at Princeton. Her main research interests include the theory of distributed computing, communication complexity, and the interface between distributed computing and the theory of CS at large. She is the program committee chair of DISC 2023, and was previously the co-PC chair of OPODIS 2020. In 2023-2024 she will hold the William R. Kenan, Jr. Visiting Professorship for Distinguished Teaching at Princeton.

Boaz Patt-Shamir is a Professor of Computer Science in the School of Electrcal Engineering in Tel Aviv University since 1997, where he directs the laboratory for distributed algorithms.
Prior to that, he was an assistant professor in Northeastern University in Boston. He received his BSc in Mathematics and Computer Science from Tel Aviv University, his MSc from Weizmann Institute, and his PhD from MIT.
His main research area is distributed and centralized algorithms for networks, including routing, scheduling, buffer management, cloud systems and recommender systems.

David Peleg received the B.A. degree in 1980 from the Technion, Israel, the M.Sc. degree in 1982 from Bar-Ilan University, Israel, and the Ph.D. degree in 1985 from the Weizmann Institute, Israel, all in computer science. He spent a post-doctoral period at IBM Almaden and Stanford University. In 1988 he joined the Department of Computer Science and Applied Mathematics at The Weizmann Institute of Science, where he is the incumbent of the Norman D. Cohen Professorial Chair of Computer Sciences. He chaired the Weizmann Institute’s Council of Professors in 2007-2008, and served as Dean of the Faculty of Mathematics and Computer Science from 2010 to 2019. His research interests include distributed network algorithms, fault-tolerant computing, communication network theory, approximation algorithms and graph theory, and he is the author of a book titled “Distributed Computing: A Locality-Sensitive Approach,” as well as numerous papers in these areas. He received the ACM Edsger W. Dijkstra Prize in Distributed Computing in 2008 and the SIROCCO Prize for Innovation In Distributed Computing in 2011. He is a Fellow of the Association for Computing Machinery (ACM) and of the European Association for Theoretical Computer Science (EATCS).

Michel Raynal is an Emeritus Professor of Informatics, IRISA, University of Rennes, France. He is an established authority in the do- main of concurrent and distributed algorithms and systems. Author of numerous papers on this topic, Michel Raynal is a senior member of Institut Universitaire de France, and a member of Academia Europaea. He was the recipient of the 2015 Innovation in Distributed Computing Award (also known as SIROCCO Prize), recipient of the 2018 IEEE Outstanding Technical Achievement in Distributed Computing Award, and recipient of an Outstanding Career Award from the French chapter of ACM Sigops. He is also Distinguished Chair Professor on Distributed Algorithms at the Polytechnic University (PolyU) of Hong Kong. Michel Raynal chaired the program committees of the major conferences on distributed computing. He was the recipient of several ”Best Paper” awards of major conferences (including ICDCS 1999, 2000 and 2001, SSS 2009 and 2011, Europar 2010, DISC 2010, PODC 2014). He has also written 13 books on fault- tolerant concurrent (shared memory and merssage-passing) distributed systems, among which the following trilogy published by Springer: Concurrent Programming: Algorithms: Principles and Foundations (515 pages, 2013), Distributed Algorithms for Message-passing Systems (510 pages, 2013), and Fault-Tolerant Message-Passing Distributed Systems: An Algorithmic Approach Springer (459 pages, 2018). His last book titled Concurrent Crash-prone Shared Memory Systems: a Few Theoretical Notions (115 pages) has been published in 2022. Michel Raynal is also the Series Editor of the Synthesis Lectures on Distributed Computing Theory published by Morgan & Claypool.

Nicola Santoro (Laurea, Pisa; Ph.D., Waterloo) is Distinguished Research Professor of Computer Science at Carleton University. 
Involved in distributed computing from the very beginning of the field, his research has focused on the algorithmic aspects, contributing seminal works, especially on synchronous computations, anonymous networks, informative labelings, and the impact of structural knowledge on computability. 
His research has also focused on the computational and algorithmic issues arising in distributed systems of  mobile computational entities  (robots, agents, sensors). With his collaborators, he has  been among  the first to investigate  distributed computing in highly dynamic (i.e., time-varying) environments (e.g., arising in ad-hoc wireless networks, social networks, etc).
For his pioneering contributions,  he has been awarded  in  2009  the “Prize for Innovation in Distributed Computing”, the first recipient.
He is the author of the book “Design and Analysis of Distributed Algorithms” (Wiley 2007), and co-author of the books “Distributed Computing by Oblivious Mobile Robots” (Morgan \& Claypool 2012) and “Distributed Computing by Mobile Entities” (Springer 2019).
He has contributed to start the main theoretical conferences in distributed computing: PODC (1982), DISC (1985) and SIROCCO (1994). He also initiated the MAC series of research meetings on “Moving and Computing”.

Jukka Suomela is Associate Professor in the Department of Computer Science at Aalto University, Finland. His work focuses on the theoretical foundations of distributed and parallel computing, with particular emphasis on the concept of locality. He was the PC chair of DISC 2019 and SIROCCO 2016 and one of the local chairs of ALGO 2018, he is serving in the EATCS council, and he is currently the chair of the DISC steering committee. He has received the FOCS 2019 best paper award and DISC 2012 and 2017 best paper awards, as well as a number of teaching awards.

Sara Tucci leads the Laboratory for trustworthy Distributed Systems at CEA List, Paris-Saclay University, France. Before joining CEA, she held a lecturer position at the University of Rome La Sapienza, where she obtained a Ph.D. in computer science. Sara’s main research focus is on distributed computing and systems, and she regularly publishes her research findings in renowned conferences and journals in the field. In recent years, Sara’s research has been primarily centered on the design and security of blockchain consensus protocols and incentives, covering both theoretical foundations and applications.