Vincent Dufour-Décieux is a researcher at the Professorship for Energy and Process Systems Engineering at ETH Zürich , focusing on developing computational methods for material screening in separation processes and global net-zero transitions. He earned his Master's in Materials Chemistry from Ecole Polytechnique (France) and a PhD in Materials Science from Stanford University , where he pioneered statistical methods combining Kinetic Monte Carlo and random graph theory to study planetary diamond formation. Research Highlights: Application of Classical Density Functional Theory (cDFT) for 100x faster adsorption property predictions in porous materials Development of science-based definitions for "hard-to-abate" emissions to guide climate action prioritization Integration of Coulombic interactions in cDFT for CO2 adsorption accuracy Article Trends : His work spans computational materials science (cDFT, random graph theory) and climate policy analysis, with recent publications in Joule , AIChE Journal , and Physical Review E . These studies emphasize scalable solutions for carbon capture, material screening efficiency, and accurate thermodynamic modeling. Collaborations : Active in international conferences (FOA15, MolMod, Gordon Research Conference) and cross-institutional projects with teams at Stanford, ETH Zürich, and industry partners.
Sebastijan Dumancic is an Assistant Professor at Delft University of Technology, focusing on neuro-symbolic AI through program synthesis and probabilistic programming. He leads the RAIL lab and collaborates with institutions like Harvard, MIT, and CNRS. His research bridges symbolic AI and machine learning, applying program synthesis to scientific discovery, transportation, and robotics. He holds an FWO-funded PhD from KU Leuven and has participated in initiatives like ELLIS and the Symbolic Computation and Machine Learning Initiative. Program synthesis Probabilistic programming Neuro-symbolic AI Constraint-based learning His recent articles highlight advancements in program synthesis, neuro-symbolic integration, and constraint satisfaction. Projects like Find2Fix and Intelligent Greenhouse Horticulture (funded by NWO) demonstrate practical applications. ELLIS Membership University Teaching Qualification He supervises numerous MSc and PhD students in projects involving logic programming, program synthesis, and probabilistic modeling. Active in workshops and symposia, he contributes to neuro-symbolic AI and scientific discovery.
Tatiana Smirnova-Nagnibeda is an Associate Professor in the Mathematics Section at the University of Geneva, where she obtained her PhD before holding positions at ETH Zurich and KTH Stockholm. She returned to UNIGE where she has established herself as a leading researcher in geometric and combinatorial group theory. Her research focuses on combinatorial, asymptotic and geometric group theory, as well as probabilities on groups and graphs. She has made significant contributions to the understanding of branch groups, self-similar groups, Schreier graphs, and spectral properties of group actions. Her work often bridges algebra, probability, and geometry, revealing deep connections between these areas through the study of Thompson's groups, Grigorchuk's group, and other important group constructions. Her recent publications demonstrate a consistent focus on subgroup structure in various classes of groups, spectral properties of Schreier and Cayley graphs, and connections to dynamical systems. She frequently collaborates with researchers from around the world, particularly with Rostislav Grigorchuk, and has mentored numerous doctoral students who have gone on to successful academic careers. Managing Editor for Groups, Geometry, and Dynamics Editor for L'Enseignement Mathématique Organizer of GAGTA conferences (2022, 2024) Organizer of specialized workshops on high-dimensional expanders (2015, 2016) She leads an active research group comprising postdoctoral fellows and doctoral students working on various aspects of group theory and its applications. Her teaching includes advanced courses on graph theory, random walks on groups, spectral theory of graphs, and amenability at the University of Geneva.
Rachid Guerraoui is a Full Professor at the École polytechnique fédérale de Lausanne (EPFL) where he leads the Distributed Computing Laboratory (DCL) within the School of Computer and Communication Sciences. He holds appointments in multiple departments including IC-SSC and IC-SIN for teaching, and serves on the IC Academic Evaluation Committee. A Moroccan/Swiss/French researcher, Guerraoui has previously been affiliated with Commissariat à l'Energie Atomique in Saclay, Hewlett-Packard Labs in Palo Alto, the Massachusetts Institute of Technology in Boston, and Collège de France in Paris. Guerraoui's research focuses on distributed and concurrent computing across various scales, from multiprocessors to wide-area networks. His work spans Byzantine fault tolerance, distributed machine learning, blockchain technologies, transactional memory, and consensus algorithms. His recent publications reveal a strong emphasis on Byzantine-resistant machine learning, decentralized learning systems, and the theoretical foundations of distributed consensus. The research demonstrates significant contributions to making distributed systems more robust, efficient, and secure against adversarial conditions. Guerraoui has received numerous prestigious awards including ACM Fellow (2012), Professor at College de France (2018), Nygaard-Dahl Award (2024), and Barroso Award (2025). His work has earned multiple best paper awards at top conferences including DISC, ICDCS, IPDPS, and ACM Middleware. He serves as Associate Editor of the Journal of the ACM (2010-2025) and has chaired program committees for major conferences such as PODC, DISC, and Middleware. As an educator, Guerraoui supervises numerous doctoral students and has mentored many successful researchers who now work at leading institutions and companies including Meta, Oracle Labs, Chainlink Labs, and Protocol Labs. He teaches courses on Distributed Algorithms and Concurrent Algorithms at EPFL, emphasizing both theoretical foundations and practical implementations. His educational initiatives include Wandida, a library of scientific e-synopses, and Zettabytes, projects aimed at making computer science accessible to broader audiences.
Ulrik Brandes serves as Full Professor and Head of the Department of Humanities, Social and Political Sciences at ETH Zurich, holding the Professorship for Social Networks. He actively teaches courses including Network Analysis and Applied Network Science: Sports Networks for Fall semester 2025, with office location at WEP J 14, Weinbergstr. 109, Zurich. His research spans Social Network Analysis, Graph Theory, and Network Science, with significant applications in sociology, sports analytics (particularly soccer and Australian Football League), and archaeological networks. As a longstanding member of the International Network for Social Network Analysis (since 2001) and the Academy of Sociology (since 2017), he bridges theoretical graph algorithms with practical interdisciplinary applications, recently expanding into sports analytics through the Football Scouting Association (2023). Analysis of his recent publications reveals strong thematic continuity in network centrality, temporal dynamics, and robustness, with increasing application diversity across sports analytics, archaeological trade networks, and decentralized social media platforms. His work consistently emphasizes efficient computational methods for real-world network problems. Honors: Simmel Award (2024) Prof. Brandes maintains active research leadership through departmental oversight and course development, though specific grant details and student advisement records are not publicly documented in available sources. His departmental role indicates substantial administrative responsibilities alongside research and teaching commitments.
David Steurer is an Associate Professor in the Department of Computer Science at ETH Zurich, where he leads the Institute for Theoretical Computer Science. His research bridges theoretical computer science, mathematics, and practical applications in machine learning and statistics. Steurer has made significant contributions to the understanding of sum-of-squares methods, semidefinite programming, and high-dimensional estimation problems. Steurer earned his B.Sc. & M.Sc. in Computer Science from Saarland University in 2006, followed by a Ph.D. in Computer Science from Princeton University in 2010 under the supervision of Sanjeev Arora. His doctoral dissertation, "On the Complexity of Unique Games and Graph Expansion," received an Honorable Mention for the ACM Doctoral Dissertation Award in 2011. Steurer's research focuses on algorithm design through mathematical programming relaxations, particularly semidefinite programming and the sum-of-squares method. His work addresses computational complexity of high-dimensional estimation problems including tensor decomposition, clustering, Gaussian mixture models, and stochastic block models. He also investigates algorithmic aspects of robustness and differential privacy, especially for estimation tasks. His theoretical contributions have practical implications for machine learning and data analysis in the presence of noise and adversarial conditions. Analysis of Steurer's recent publications reveals a consistent trajectory in advancing the sum-of-squares framework for high-dimensional estimation and robust statistics. His work demonstrates how sophisticated mathematical programming techniques can provide certifiable guarantees for challenging problems in machine learning. The research spans theoretical foundations while maintaining relevance to practical applications, particularly in scenarios involving corrupted or noisy data. A notable trend is the extension of sum-of-squares methods to handle increasingly complex statistical models while providing rigorous performance guarantees. ERC Consolidator Grant (2019) Michael and Sheila Held prize (2018, with Raghavendra) Invited speaker at International Congress of Mathematicians (2018) STOC Best Paper Award (2015) Alfred P. Sloan Research Fellowship (2014) NSF CAREER Award (2014) Microsoft Research Faculty Fellowship (2014) FOCS Best Paper Award (2010) Steurer has advised numerous PhD students and postdocs who have gone on to prominent positions, including Sam Hopkins (now faculty at MIT), Jonathan Shi, and Aaron Potechin. His research is supported by multiple prestigious grants, including an ERC Consolidator Grant, an NSF CAREER Award, and a Microsoft Research Faculty Fellowship. He has served on numerous program committees for top theoretical computer science conferences and has been recognized for his service to the community through roles such as internal member of the Scientific Advisory Committee of the Institute for Theoretical Studies at ETH Zurich. As head of the Institute for Theoretical Computer Science at ETH Zurich, Steurer leads a research group focused on advancing the theoretical foundations of computer science with particular emphasis on mathematical optimization methods. His team explores the boundaries of what can be efficiently computed in high-dimensional settings, with applications spanning machine learning, statistics, and data science. The group maintains strong connections with both theoretical and applied researchers across ETH and the broader academic community.
Florent Krzakala is a Full Professor at École polytechnique fédérale de Lausanne (EPFL) in Switzerland, holding positions across multiple departments including the School of Basic Sciences (SB), School of Engineering (STI), and specifically within the Department of Physics (IPHYS) and Department of Electrical Engineering (IEM). He leads the Information, Learning and Physics Laboratory (IdePHICS) and maintains an office at ELD 239, Station 11, 1015 Lausanne. His research bridges statistical physics and computational disciplines, with significant contributions to understanding the theoretical foundations of machine learning and optimization problems. Dr. Krzakala received his MSc in Physics from Orsay, France in 1999, followed by a PhD in Statistical Physics from Orsay, Paris XI, France in 2002, and completed a postdoctoral position at Roma La Sapienza in 2004. This strong foundation in physics has informed his interdisciplinary approach to computational problems. His research interests span Statistical Physics, Machine Learning, Probability and Statistics, Computer Science, Information Theory, Inference on Graphs, Random Constraint Optimization, and Computational Optics. Krzakala's work focuses on applying methods from statistical physics to problems in theoretical computer science, probability, and machine learning. He investigates how concepts from disordered systems and phase transitions can illuminate computational barriers in optimization and inference tasks. His research has particular relevance for understanding the behavior of neural networks, compressed sensing, and high-dimensional statistical models. Analysis of his recent publications reveals a strong trend toward understanding the fundamental limits of learning in high-dimensional settings, with particular emphasis on phase transitions, statistical-to-computational gaps, and the theoretical properties of deep learning architectures. His work frequently bridges rigorous mathematical analysis with practical machine learning applications, demonstrating how insights from statistical physics can inform algorithm design and theoretical understanding in AI. Krzakala actively mentors the next generation of researchers, supervising numerous PhD students whose work continues to advance these interdisciplinary fields. His laboratory serves as a hub for researchers exploring the intersection of physics and computation, fostering collaborations across traditional disciplinary boundaries. He teaches advanced courses including Fundamentals of Inference and Learning, Statistical Physics, and Statistical Physics for Optimization & Learning, which examine the connections between physical principles and computational methods. His educational materials, including lecture notes on statistical physics methods in optimization and machine learning, have become valuable resources for students and researchers worldwide. As founder and scientific advisor of the startup Lighton, Krzakala has also demonstrated a commitment to translating theoretical insights into practical applications, particularly in the realm of optical computing for machine learning tasks.
Benny Sudakov is a Professor of Mathematics at ETH Zurich, where he conducts research in combinatorics. He has previously held positions at UCLA, Princeton University, and the Institute for Advanced Study. His work is supported by the SNSF grant 200021_196965. Research Interests: His primary research areas include Extremal Graph and Hypergraph Theory, Ramsey Theory, Random Structures, and the application of Algebraic and Probabilistic Methods in Combinatorics, with strong connections to Theoretical Computer Science. He investigates fundamental structural properties of discrete systems, such as the existence of regular subgraphs, extremal configurations, and the behavior of random combinatorial objects. The recent popular science articles on his work highlight a consistent trend of solving long-standing open problems in extremal combinatorics using sophisticated probabilistic and algebraic techniques. His research spans topics like equiangular lines, graph decompositions, and the emergence of cycles in sparse graphs, demonstrating a deep focus on the interplay between structure and randomness. Scientific Awards: No specific awards are mentioned in the provided text. Advising and Grants: He has advised numerous Ph.D. students, many of whom have gone on to become professors at top universities (e.g., Oxford, Stanford, CMU, ETH, Princeton). His research is currently funded by the Swiss National Science Foundation (SNSF). He has organized workshops and seminars, such as the Theory of Combinatorial Algorithms Mittagsseminar at ETH and a workshop at UCLA on Extremal and Probabilistic Combinatorics. Labs and Teams: He is a key member of the combinatorics group at ETH Zurich and co-organizes the Theory of Combinatorial Algorithms Mittagsseminar, a central forum for research discussions in discrete mathematics at the institution.
Christoph Hertrich is a tenure-track professor for Applied Discrete Mathematics at University of Technology Nuremberg, where he conducts research at the intersection of discrete mathematics, theoretical computer science, and machine learning. His work particularly focuses on applying polyhedral geometry and combinatorial optimization techniques to neural network theory, with significant contributions to understanding the computational complexity and expressivity of neural networks. Hertrich received his BSc and MSc degrees from TU Kaiserslautern (2013-2018) working with Sven O. Krumke, followed by his PhD at TU Berlin (2018-2022) under the supervision of Martin Skutella. His doctoral thesis, titled "Facets of Neural Network Complexity," laid foundational work for his current research direction. Prior to joining UTN, he held postdoctoral positions at Université libre de Bruxelles (2023-2024) with a Marie Skłodowska-Curie fellowship under Samuel Fiorini, and at LSE London (2022-2023) with László Végh. He also served as a substitute professor for discrete mathematics at Goethe-Universität Frankfurt during the winter semester of 2023/24. Hertrich's research interests center on the mathematical foundations of neural networks, with particular emphasis on polyhedral geometry approaches. His work explores computational complexity questions related to neural network training and architecture, expressivity bounds, and connections to combinatorial optimization problems. He has made significant contributions to understanding the relationship between neural network depth and function representation, the complexity of counting linear regions in ReLU networks, and the application of extended formulations to neural network theory. His approach combines rigorous theoretical analysis with practical implications for neural network design and optimization. His recent publication record reveals a strong trend toward establishing fundamental theoretical limits and connections between deep learning and discrete mathematics. A significant portion of his work examines computational complexity of various neural network problems, often proving hardness results or establishing bounds on expressivity. He has also developed novel connections between polyhedral combinatorics and neural network architecture, demonstrating how techniques from operations research can inform deep learning theory. Marie Skłodowska-Curie fellowship Since February 2025, Hertrich has been supervising PhD student Moritz Stargalla at UTN. His research has been supported by prestigious fellowships including a Marie Skłodowska-Curie fellowship during his postdoctoral period in Brussels. He is organizing a workshop on "Polyhedral Geometry for Neural Networks" in March 2026 in Nuremberg, highlighting his leadership in this emerging interdisciplinary field.
Prof. Dan Olteanu is a full professor at the Department of Informatics, University of Zurich, leading the Data Systems and Theory (DaST) group. He holds visiting professorships at the University of Oxford and is an emeritus fellow of St Cross College. His academic journey includes a PhD from Ludwig Maximilian University (2005), postdoctoral roles at Saarland University and Cornell University, and prior faculty positions at Oxford (2007–2020). He has also worked in industry with companies like LogicBlox and RelationalAI, focusing on database systems and AI. Education: Bachelor’s in Computer Science, Politehnica University of Bucharest (2000) PhD in Computer Science, Ludwig Maximilian University (2005) Professional Roles: Full Professor, University of Zurich (since 2020) Visiting Professor, University of Oxford Emeritus Fellow, St Cross College Editorial Roles: ACM TODS, VLDBJ, SIGMOD Conference Chair: ICDT Council (since 2022) His research focuses on data systems theory, including query optimization, probabilistic databases, factorized databases, and in-database machine learning. He co-authored the seminal book Probabilistic Databases (2011) and has pioneered algorithms for efficient machine learning over relational data and incremental maintenance of analytical workloads. His work emphasizes scalable, theoretically grounded solutions for real-world data challenges. Awards: ICDT 2019 Best Paper Award ACM SIGMOD 2018 Distinguished PC Member Award ERC Consolidator Grant (2016) Oxford Outstanding Teaching Award (2009) Grants & Funding: Supported by Google, Microsoft Azure, Amazon AWS, EPSRC, and the European Commission. His research bridges academia and industry, with contributions to commercial systems like LogicBlox and RelationalAI. Labs & Teams: Heads the DaST group at Zurich, focusing on data systems theory and applications. Collaborates widely in the database and AI communities.
Michihiro Yasunaga is an Assistant Professor in the Department of Computer Science at Stanford University's School of Engineering. He received his PhD in Computer Science from Stanford, advised by Percy Liang, Jure Leskovec, and Chris Manning. Prior to his faculty position, he worked as a researcher at Google DeepMind and Meta. His research focuses on building LLMs and agents that assist humans in diverse tasks, with particular expertise in post-training techniques (RL, reward models, and evaluation), reasoning systems (AnalogicalReasoner), retrieval and tool use for LLMs (LinkBERT, QAGNN, DRAGON, REPLUG, HippoRAG), and multimodality (RA-CM3, Med-Flamingo, Transfusion). His work spans both theoretical foundations and practical applications of large language models. Yasunaga's publication record demonstrates significant contributions to the field of AI, with 15 recent articles (2023-2025) covering diverse aspects of language model development, evaluation, and application. His research shows a clear trajectory toward building more capable, efficient, and reliable multimodal AI systems, with particular emphasis on knowledge integration and robust evaluation frameworks. Among his notable achievements is the Best Paper Award at AAAI 2023 Deep Learning on Graphs Workshop for the DRAGON paper. He has also been deeply involved in major benchmarking efforts including HELM and HEIM, which provide comprehensive evaluation frameworks for language and vision-language models. Yasunaga actively contributes to the research community through service roles including Organizing Committee for the Workshop on Knowledge-Augmented Methods for NLP (ACL 2024), Workshop on Structured and Unstructured Knowledge Integration (NAACL 2022), and the Workshop on Scientific Document Summarization (SIGIR 2017-2020). He has also served on program committees for top conferences including NeurIPS, ICML, ICLR, ACL, EMNLP, CVPR, and ICCV from 2020-2025.
Grigory Mikhalkin is a Full Professor at the University of Geneva, where he has been a faculty member since 2008. He is considered one of the founders of Tropical Geometry, a domain of algebraic geometry governed by (max,+)-calculus where geometric objects degenerate to their piecewise-linear limits. He leads the "ALGEBRA AND GEOMETRY" research group at the university. Mikhalkin studied at Leningrad and Michigan State University under the supervision of Oleg Viro and Selman Akbulut. After receiving his PhD in 1993, he completed postdoctoral training at Princeton, Bonn, Toronto, Berkeley, and Harvard (1993-2000). He served as associate and then full Professor at the University of Utah before moving to the University of Toronto, eventually joining the University of Geneva in 2008. Mikhalkin's primary research areas are Geometry and Topology, with a particular focus on Tropical Geometry. His work bridges algebraic geometry with combinatorial structures, exploring how complex geometric objects can be understood through their piecewise-linear tropical counterparts. This approach has proven fruitful in solving problems in enumerative geometry and has connections to mathematical physics through the study of sandpile models and self-organized criticality. His research group actively explores the connections between tropical geometry, symplectic geometry, and real algebraic geometry, organizing regular seminars including the "Séminaire Fables Géométriques." The recent publications of Professor Mikhalkin demonstrate a strong focus on the intersection of tropical geometry with sandpile models and self-organized criticality. His work has evolved to examine tropical aspects of number theory, lattice sums, and even applications to economics through auction theory. A significant portion of his recent research explores the patterns and structures that emerge in sandpile models across various lattices and dimensions, connecting discrete mathematics with continuum limits through tropical techniques. Prize of the St. Petersburg Mathematical Society (1999) Silver Medal of the Mexican Mathematical Society (2011) Canada Research Chair (2004-2009) Friedrich-Wilhelm-Bessel Research Award of the Alexander-von-Humboldt Foundation (2007-2008) European Research Council Advanced Grant (2010-2015) Chair of Fondation Sciences Mathématiques de Paris (2013-2015) Mikhalkin has successfully advised several PhD students to completion, including Kristin Shaw (2011), Lionel Lang (2014), Nikita Kalinin (2015), Mikhail Shkolnikov (2017), and Johannes Josi (2018). His research has been supported by prestigious grants including the ERC Advanced Grant and the Canada Research Chair. He presented his work at the Bourbaki seminar in 2003 and was selected as a Geometry speaker at the International Congress of Mathematicians in 2006, highlighting the significance of his contributions to the field. Professor Mikhalkin leads the "ALGEBRA AND GEOMETRY" research group at the University of Geneva, which includes current members Thomas Blomme, Francesca Carocci, Aloïs Demory, Gurvan Mével, and Antoine Toussaint. The group has a strong track record of postdoctoral fellows and alumni, including notable researchers such as Ivan Bazhov, Johan Bjorklund, Rémi Crétois, and others. They organize several seminars including the "Séminaire Fables Géométriques" and have historical connections to the Battelle Seminar and Tropical working group Seminar.
Eythan Levy serves as Senior Assistant in Digital Archaeology at the University of Zurich's Institute of Classical Archaeology within the Faculty of Arts and Social Sciences. Previously, he led an SNSF SPARK project at the University of Bern (2024) and conducted postdoctoral research on stamp seals from the Southern Levant (2022-2023). His research interests focus on computational approaches to archaeological problems, particularly: Computer applications and quantitative methods in archaeology Ancient chronology of the Iron Age Levant Northwest Semitic epigraphy and paleography Archaeology of the Southern Levant Ancient Egyptian archaeology and epigraphy His work bridges computer science and archaeology through innovative methodological frameworks. Levy's publication trends demonstrate consistent interdisciplinary output combining computational methods with archaeological analysis. Recent work focuses on chronological modeling tools, epigraphic analysis of Hebrew seals, multispectral imaging of ostraca, and computational approaches to ceramic typology. His research shows strong emphasis on developing formalized schemes for synchronizing archaeological data and creating specialized software solutions. Levy has developed several significant archaeological software tools : ChronoLog : For computer-assisted chronological modeling Scrypt : Web application for computer-assisted decipherment of ancient inscriptions TPQ Composer : For displaying stratigraphic termini post quem Artifacts Analyzer : For analyzing archaeological artifact datasets These tools represent his commitment to creating practical computational solutions for archaeological challenges. His academic background uniquely combines computer science and archaeology: PhD in Archaeology (Tel Aviv University, 2017-2021) PhD in Computer Science (Université Libre de Bruxelles, 2003-2009) Multiple MA degrees in Archaeology and Ancient Oriental Languages Teaching certificate for higher education This dual expertise enables his innovative approach to digital archaeology.
Lenka Zdeborová is an Associate Professor at EPFL, jointly affiliated with the School of Basic Sciences and School of Computer and Communication Sciences. She leads the Laboratory of Statistical Physics of Computational Systems, where her research bridges statistical physics, machine learning, and computational biology. Education: PhD in Physics, Université Paris-Cité (2012) MSc in Fundamental Physics, École Normale Supérieure (2009) BSc in Physics, École Normale Supérieure de Lyon (2007) Her work focuses on phase transitions in learning algorithms, high-dimensional statistics, and neural network theory. Current projects investigate fundamental limits of machine learning, dynamics of graph neural networks, and applications to biological systems. Recent publications explore attention mechanisms in transformers, neural network depth advantages, and Bayes-optimal learning. Methodological innovations include cavity methods for hypergraphs and analysis of high-dimensional inference problems. Supervises doctoral students researching statistical physics approaches to machine learning and optimization. Teaches graduate courses in data science and machine learning for physicists.
Mattia Bianchi is a Lecturer at the Department of Information Technology and Electrical Engineering, ETH Zurich, Switzerland. He is affiliated with the Automatic Control Laboratory under Prof. Florian Dörfler, with office location at ETL I 34, Physikstrasse 3, Zurich. His research focuses on developing distributed, efficient, and robust methods for decision and control problems in complex network systems, including power grids and cognitive radio networks. Bachelor’s degree in Information and Communication Engineering (2016), University of L’Aquila, Italy Master’s degree in Systems Engineering (2018), University of L’Aquila, Italy PhD in Systems and Control (2018–2023), TU Delft, The Netherlands Postdoctoral researcher (2023–present), ETH Zurich, Switzerland His methodological approach integrates operator theory, learning algorithms, game theory, and data-driven control. Key research themes include uncovering common structures in optimization and control algorithms, with applications in distributed feedback optimization, Nash equilibrium seeking, and stabilization of constrained systems. Current work explores partial-decision information frameworks and linear convergence guarantees. For detailed information on his publications, visit his Google Scholar profile . Mattia actively supervises Master’s theses and semester projects, inviting candidates to contact him with their academic credentials.
