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.
Manos Athanassoulis is an Associate Professor in the Department of Computer Science at the College of Arts and Sciences, Boston University. He is the Founder and Director of the BU Data-intensive Systems and Computing (DiSC) lab and a member of the BU MiDAS group. His research focuses on data systems, particularly cloud data management, hybrid transactional/analytical workloads, and integration with emerging hardware such as non-volatile memory and heterogeneous computing. His educational background includes a PhD from EPFL (2014), an MSc in Computer Systems Technology, and a BSc in Informatics and Telecommunications from the University of Athens, Greece. Prior to BU, he was a Postdoctoral Researcher and Research Associate at Harvard University, supported by a SNSF Postdoc Mobility Fellowship. His research interests span data systems, database architectures, LSM trees, indexing, storage systems, and performance optimization. He explores how novel hardware can be leveraged to improve data management efficiency and scalability, especially in cloud environments. His recent publications (2021–2025) predominantly focus on LSM trees, covering topics such as compaction policies, Bloom filter tuning, DPU offloading, adversarial resilience, and sustainable caching. Earlier works include foundational contributions on access methods (RUM Conjecture) and optimal key-value stores (Monkey). The trend shows a consistent focus on data system efficiency, adaptability, and robustness under varying workloads and hardware constraints. Scientific Awards: NSF CAREER Award (2022) Facebook Faculty Research Award (2020) NSF CRII Award (2019) Best of VLDB 2017 and Best of SIGMOD 2017 SIGMOD Most Reproducible Paper Award (2017) Multiple ACM SIGMOD Distinguished PC Member recognitions (2018–2025) VLDB 2023 Best Demo Award RedHat Collaboratory Research Incubation Awards (multiple, 2021–2023) SNSF Postdoc Mobility Fellowship (2015–16) IBM PhD Fellowship (2011–12) Dr. Athanassoulis has advised numerous students and collaborators, evident from his co-authorship on works with researchers such as Niv Dayan, Stratos Idreos, and A. Ailamaki. His grants include major awards from NSF, Facebook, and RedHat, supporting research in robust data systems, hardware-software co-design, and learned cost models. He has also been recognized for teaching excellence at Harvard University. He leads the DiSC lab at Boston University, which focuses on data-intensive computing and systems research. The lab explores next-generation data architectures, particularly in cloud and hardware-aware environments. Collaborations with the BU MiDAS group enhance interdisciplinary research in data science and AI.
Simon Ruffieux is a Senior Researcher and Lecturer at the Department of Computer Science, University of Fribourg, and a member of the Human-IST Institute. He currently leads the HIP-Initiative (Human-IST x SwissPost Initiative) and coordinates academic projects related to Swiss Post. His academic roles include Lecturer and Senior Assistant , reflecting his active engagement in teaching and research. His research focuses on leveraging advanced technologies to support individuals, particularly those with special needs. Key areas include: Machine Learning and Data Science for urban systems (e.g., bike-sharing optimization) Human-Computer Interaction (HCI), especially gesture recognition and multimodal interfaces Augmented and Virtual Reality applications in rehabilitation and assistance Development of smart glasses for visually impaired users Physiological signal analysis for workload classification The 15 most recent publications reveal a strong trend in applying AI and data science to real-world challenges, particularly in assistive technologies and urban mobility. His work often involves interdisciplinary collaboration, integrating computer science with psychology, rehabilitation, and industrial applications. There is a consistent emphasis on user-centered design and real-world usability. Simon Ruffieux has not been mentioned as receiving specific scientific awards in the provided text. He has advised or collaborated with several researchers, including Nicolas Spycher, Samuel Torche, and Nicolas Ruffieux, on projects related to forecasting, AR, and gesture recognition. While no formal grant details are listed, his leadership of the HIP-Initiative suggests involvement in externally funded academic projects. His work is closely tied to the Human-IST Institute, where he contributes to interdisciplinary research in human-centered computing. He is actively involved in research teams focused on assistive technologies, gesture interaction, and data-driven urban solutions. The Human-IST Institute serves as the primary hub for his collaborative efforts, particularly through the HIP-Initiative with Swiss Post.
Xue-Mei Li is a Professor of Mathematics at Imperial College London and École Polytechnique Fédérale de Lausanne (EPFL). She holds chairs in Probability and Stochastic Analysis at both institutions. Her research focuses on stochastic analysis, geometric stochastic processes, and multi-scale systems, with contributions to areas like Malliavin calculus, fractional dynamics, and coarse curvature. Li has held positions at the University of Warwick, University of Connecticut, and others, supported by fellowships from the Alexander von Humboldt Foundation, Royal Society, and MSRI. Her work addresses fundamental questions in stochastic differential equations, geometric analysis, and their applications to complex systems. Education and Career: PhD in Mathematics, University of Warwick EPSRC Research Associate Faculty positions at the University of Connecticut (tenured Associate Professor) Research Interests: Her research spans stochastic differential equations (SDEs), stochastic partial differential equations (SPDEs), geometric stochastic analysis, and fractional dynamics. Notable contributions include the BEL formula, strict local martingales, and solutions to longstanding problems in strong completeness on non-compact manifolds. She explores interactions between stochastic processes and geometric structures, including coarse Ricci curvature and homogenization theory. Awards and Grants: Supported by NSF, EPSRC/UKRI, and Swiss NSF grants Awarded fellowships from Alexander von Humboldt Foundation, Royal Society, and MSRI Advising and Teams: PhD students: Johann Gehringer, Rhys Steel, Julian Sieber, and others Leading working groups on stochastic analysis and geometric dynamics
Simon Weber is a researcher affiliated with the ETH Zurich (Department of Computer Science). His work focuses on Unique Sink Orientations (USOs) , a combinatorial abstraction of optimization problems like Linear and Quadratic Programming. Simon's research spans three areas: (1) Structure of USOs and their links to Oriented Matroids; (2) Constructions of high-dimensional USOs to analyze algorithm complexity; and (3) Algorithmic improvements for sink-finding. He also explores topics in graph compression, neural networks, and ∃R-complete problems. Key Publications: PhD thesis on USO reductions, ∃R-completeness in neural training, and USO phase analysis. Scientific Contributions: Advances in USO complexity, FPT algorithms for MaxCut, and recognition of geometric hypergraphs and nerves of convex sets. He has supervised multiple theses at ETH Zurich, including topics on USO visualization, MaxCut algorithms, and necklace splitting. His teaching experience includes being a Head Assistant for courses like Geometry: Combinatorics & Algorithms and Topological Data Analysis . Simon's work has been recognized with Best Paper and Best Student Paper Finalist awards at SC19.
Francesco Regazzoni is a Senior Researcher at the Faculty of Informatics, Università della Svizzera italiana (USI), and affiliated with the Dalle Molle Institute for Artificial Intelligence (IDSIA USI-SUPSI). His work bridges embedded systems, cybersecurity, and artificial intelligence, with a focus on securing hardware and cyber-physical systems. Research Interests: His expertise spans embedded and cyber-physical systems security, side-channel attacks, post-quantum cryptography, hardware trojans, random number generators, and the security of AI and approximate computing. He also contributes to hardware/software co-design and operating systems security. The analysis of his recent publications reveals a consistent focus on hardware and system-level security , particularly in resource-constrained environments like IoT and embedded devices. His work integrates machine learning for attack detection and applies formal methods to ensure trust in hardware. A growing emphasis is placed on securing AI systems from physical and adversarial threats. Scientific Contributions: Over 100 peer-reviewed publications One book and one patent Extensive international collaboration (Belgium, Netherlands, USA, Switzerland, Singapore) Advising and Grants: While specific advisees and grants are not listed, his leadership in funded research projects and involvement with ALaRI and IDSIA suggest active mentorship and project coordination. His work has been supported by industry (e.g., ST Microelectronics, HP), the Swiss National Foundation, and the European Union. Labs and Teams: He is part of the Graph Machine Learning Group (GMLG) at IDSIA, which evolved from the Advanced Learning and Research Institute (ALaRI). This group focuses on graph machine learning, reinforcement learning, and dynamical systems, particularly in non-stationary environments.
Davide La Vecchia is a Full Professor at the Research Institute for Statistics and Information Science (RISIS) at the University of Geneva, Switzerland. He holds dual PhDs in Statistics from Bocconi University (2007) and Economics from Università della Svizzera italiana (2011). His academic journey includes roles as an Assistant Professor at the University of St. Gallen and Monash University, and he has held visiting positions at Princeton University, the University of Copenhagen, and CREST (Paris). His expertise spans time series analysis, robust and semiparametric inference, financial econometrics, and spatial statistics. Key research contributions include work on saddlepoint approximations, optimal transportation methods, and latent variable models. Davide has led multiple grants, including from the Swiss National Science Foundation and the Australian Research Council. He serves as a referee for top-tier journals in statistics and econometrics. Teaching focuses on advanced statistical methods, including probability theory, time series analysis, and multivariate inference. His recent work emphasizes high-dimensional data modeling, spatio-temporal factor models, and applications to commodities trading networks. He has been honored with editorial roles and speaker invitations at global conferences, reflecting his leadership in statistical methodology.
Suryanarayana Sankagiri is a postdoctoral researcher at the École Polytechnique Fédérale de Lausanne (EPFL) in Switzerland, affiliated with the Information and Network Dynamics (INDY1) group under Professor Matthias Grossglauser. Previously, he earned his Ph.D. in Electrical & Computer Engineering (2018-2022) from the University of Illinois at Urbana-Champaign , where he was supervised by Bruce Hajek and participated in the Coordinated Science Lab . He also holds an M.S. in Electrical & Computer Engineering from the University of Illinois (2016-2018) and a B.Tech. in Electrical Engineering from the Indian Institute of Technology Bombay (2012-2016). Education : Ph.D., Electrical & Computer Engineering, University of Illinois (2018-2022) M.S., Electrical & Computer Engineering, University of Illinois (2016-2018) B.Tech., Electrical Engineering, IIT Bombay (2012-2016) Suryanarayana's research focuses on discrete choice models and their application to recommendation systems , with a particular emphasis on learning from choice data and developing novel models for human decision-making. His broader interests include blockchain security under adverse network conditions, network dynamics , probabilistic modeling , and algorithm design . Recent work explores nonconvex matrix factorization and contextual dueling bandits for recommendation systems. His publications span theoretical and applied domains, including high-impact venues like ICML , Stochastic Systems , and IEEE Transactions on Networking . Themes include blockchain efficiency , hidden community detection in preferential attachment graphs, and temporal analysis of Indian classical music. Current projects involve refining recommendation systems through sparse comparison data and designing protocols for resilient blockchain networks. Scientific Awards : zkCapital Paper of the Week (2021) Rambus Fellowship (2021) Mavis Future Faculty Fellowship (2019) List of Teachers Ranked as Excellent (2019) Nomination for IIT Bombay Undergraduate Colloquium (2016) Best Poster Award, IIT Bombay Undergraduate Research Symposium (2013) Suryanarayana has advised no students listed in the provided materials. His work has been supported by fellowships such as the Mavis Future Faculty Fellowship and Rambus Fellowship . He contributes to the INDY1 group at EPFL, which investigates information and network dynamics through interdisciplinary approaches combining probability , network theory , and algorithmic design .
Dimitar Jetchev is a Swiss National Science Foundation Professor in number theory, arithmetic algebraic geometry, and mathematical cryptology at the School of Basic Sciences, EPFL. He leads the GR-JET research group and holds positions in the Mathematics Section (TAN) and SMA-GE unit. University of California at Berkeley, Ph.D. in Mathematics (2008) Harvard University, B.A. in Mathematics (2004) Jetchev's research spans number theory and cryptography, focusing on elliptic curves, Selmer groups, Euler systems, Heegner points, and complexity analysis of cryptologic algorithms. His work bridges pure mathematics and cryptographic applications like ECC and symmetric key protocols. His recent publications analyze isogeny graphs of abelian varieties, discrete logarithm problems in genus 2, equidistribution phenomena, and Euler systems. These works explore connections between automorphic representations, unitary groups, and cryptologic algorithms. Swiss National Science Foundation Professor Jetchev has advised PhD students including Boumasmoud Mohamed Réda, Dudeanu Alina, and Vuille Marius Lorenz. His research group GR-JET collaborates with institutions like IHES and EPFL's LACAL lab. He works on unitary Shimura varieties, special cycles, and their applications to Iwasawa theory and the Bloch-Kato conjecture. The GR-JET group investigates isogeny-based cryptosystems and algorithmic improvements in discrete logarithm computations.
Leon Bungert is a Professor of Mathematics of Machine Learning at the University of Würzburg, working in applied analysis and numerics with a particular focus on data science and machine learning. His research investigates PDEs and variational models on graphs, adversarial robustness of machine learning, variational regularization, and nonlinear optimization. Dr. Bungert serves as a guest editor for the European Journal of Applied Mathematics, an associate editor for Advances in Continuous and Discrete Models: Theory and Applications, and is a member of the program committee at SSVM 2025. He is also an ELLIS member and actively organizes conferences and workshops, including "MIA'25" at IHP in Paris (January 13-15, 2025), "Synergies of Machine Learning and Numerics" in Osaka (March 11-13, 2025), and "Mathematical Analysis of Adversarial Machine Learning" in Oaxaca (August 17-22, 2025). Research Interests Dr. Bungert's primary research areas include: PDEs on graphs Adversarial robustness in machine learning Inverse problems Optimization Variational problems in L-infinity Nonlinear eigenvalue problems Image reconstruction with structural priors His work bridges theoretical mathematics with practical applications in machine learning, particularly focusing on the mathematical foundations of deep learning and developing robust algorithms that can withstand adversarial attacks. He has made significant contributions to understanding the connections between partial differential equations and machine learning algorithms. Research Trends Analysis of Dr. Bungert's recent publications reveals a strong focus on the intersection of machine learning and mathematical analysis. A key theme is the application of variational methods and partial differential equations to machine learning problems, particularly in understanding and improving the robustness of neural networks against adversarial examples. His work on Lipschitz learning on graphs has established important theoretical foundations for graph-based semi-supervised learning. Additionally, his research on the infinity Laplacian and p-Laplacian equations provides deep insights into the mathematical structure of machine learning algorithms. The development of Bregman learning frameworks for sparse neural networks represents a significant contribution to efficient deep learning model training. Professional Activities Dr. Bungert is actively involved in the academic community through editorial roles and conference organization. His current professional activities include: Guest editor for the European Journal of Applied Mathematics Associate editor for Advances in Continuous and Discrete Models: Theory and Applications Member of the program committee at SSVM 2025 ELLIS member Co-organizer of multiple international conferences and workshops Technical Contributions Dr. Bungert has developed several open-source software packages that implement his theoretical contributions, including: Code for convergence rates of Lipschitz learning on graphs A Bregman training framework for sparse neural networks CLIP: Cheap Lipschitz Training of Neural Networks Nonlinear Power Method for Proximal Operators and Neural Networks Robust Image Reconstruction with Misaligned Structural Information These implementations are primarily in Python and MATLAB, demonstrating his commitment to making theoretical advances accessible for practical applications.
Christoph Grunau is a Researcher at ETH Zürich's Theoretical Computer Science department, affiliated with the Professorship for Computer Science. His work focuses on distributed computing, parallel algorithms, graph theory, and network decomposition. He has contributed to advancements in scalable MPC (Massively Parallel Computing) algorithms, efficient parallel derandomization techniques, and deterministic network decomposition methods. His research emphasizes algorithmic efficiency, theoretical guarantees, and applications in distributed systems, quantum computing, and dynamic graph problems. Key contributions include work on graph orientation, dynamic coloring algorithms, and clustering techniques such as k-center and k-means++. His publications span topics like shortest path algorithms with negative edge weights, probabilistic methods for algorithm analysis, and distributed symmetry breaking in sparse graphs. Grunau's research bridges foundational theory with practical distributed computing challenges, addressing scalability and efficiency in both classical and emerging computational frameworks.
Miloš Stojaković is a Full Professor at the Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad, Serbia. He has held this position since 2016, following roles as Associate Professor (2011–2016) and Assistant Professor (2006–2011). His research focuses on positional games, discrete and computational geometry, discrete random structures, combinatorial algorithms, and graph theory. He leads the Foundations of Computer Science group since 2018. Stojaković earned his Ph.D. in Computer Science from ETH Zurich (2005), advised by Emo Welzl and Tibor Szabó, and holds M.Sc. and B.Sc. degrees from the University of Novi Sad. He has been recognized with the Dr Z. Đinđić Award (2008) for best young scientist in Vojvodina and the Best Student of University of Novi Sad Award (1998/99). He has advised three Ph.D. students: Mirjana Mikalački, Marko Savić, and Jelena Stratijev. His work spans over 60 publications, including seminal contributions to positional games and computational geometry. He serves on editorial boards of Discrete Mathematics & Theoretical Computer Science and the Novi Sad Journal of Mathematics . Stojaković teaches courses such as Combinatorial Algorithms, Graph Theory, and Theoretical Computer Science at the University of Novi Sad. He has also taught specialized courses on positional games at institutions like the University of Buenos Aires and Eötvös Loránd University Budapest. His research interests emphasize algorithmic and combinatorial aspects of games, geometry, and graph theory.
Giona Casiraghi is a Senior Researcher at ETH Zurich specializing in network science and complex systems, with a primary focus on resilience modeling in social organizations and data-driven network analysis. His work bridges theoretical advances in statistical network models with practical applications in supply chain management, open-source software ecosystems, and online social dynamics. His research interests center on developing quantitative methods for analyzing complex systems, particularly through the generalized hypergeometric ensemble of random graphs (gHypEG). Casiraghi's work spans multiple disciplines including network science, statistical physics, data science, and resilience theory, with particular expertise in temporal network analysis, multi-edge networks, and zero-inflation models for sparse networks. His research group develops the ghypernet R package , providing open-source tools for network regression and inference. Analysis of his recent publications reveals a strong trend toward applying network science to real-world resilience problems, particularly in pharmaceutical supply chains and social organizations. His 2025 Science paper on US tariffs threatening medicine supply chains exemplifies this practical turn, while his methodological work on zero-inflated network models (PNAS Nexus 2025) demonstrates continued theoretical innovation. Casiraghi frequently collaborates with Frank Schweitzer and others in the Systems Group at ETH Zurich, producing interdisciplinary work that bridges computer science, economics, and social science. Casiraghi's research has significant implications for understanding how social organizations withstand shocks and how supply chains can be made more resilient to disruptions. His work on the gHypEG framework provides foundational tools for network scientists across multiple disciplines, while his applied research offers concrete insights for policymakers and industry practitioners dealing with complex system failures. He has contributed to numerous projects examining online migration after community bans, developer productivity in open-source projects, and reconstruction of social relations from interaction data. His research methodology typically combines large-scale data analysis with advanced statistical modeling, often developing new network analysis techniques to address specific research questions.
Backhausz Ágnes is a Assistant Professor at Eötvös Loránd University's Faculty of Science , specifically in the Department of Probability Theory and Statistics . She also holds a part-time Researcher position at the Alfréd Rényi Institute of Mathematics . Her academic journey includes habilitation and a PhD in Mathematics, focusing on random graph models and their asymptotic properties. Research Group: Struktúrák limeszei (since 2013, part-time since 2015) Grants: ERC Grant on 'Limits of Discrete Structures' (2014–2019) Ágnes specializes in Probability Theory and Random Graphs , with emphasis on graph limits , factor of i.i.d. processes , and spectral theory . Recent publications analyze epidemic spread on multilayer networks, entropy inequalities, and action convergence in graph operators. Her work bridges theoretical mathematics with applications in network science and stochastic processes. Notable awards include the Grünwald Géza Memorial Medal (2014) from the Bolyai János Matematikai Társulat. She actively contributes to academic service as a Supervisor and Training Lead for the Beyond The Edge Marie Curie Doctoral Network (2024–2027) and serves on program committees for conferences like Eurocomb and the European Girls' Mathematical Olympiad . Her teaching portfolio spans Probability Theory, Stochastic Processes, and Mathematical Statistics at both undergraduate and graduate levels.
Prof. Dr. Christian Cachin is a Professor at the Institute of Computer Science of the University of Bern, Switzerland. He leads the Cryptology and Data Security research group and serves as Deputy Director of the Institute. His work focuses on cryptography, blockchain technology, and distributed systems, with particular emphasis on consensus protocols, privacy-preserving technologies, and secure multi-party computation. He has contributed to foundational research in threshold cryptography, transaction graph models, and DAG-based consensus mechanisms. Prof. Cachin's research spans theoretical and applied aspects of distributed systems, including blockchain scalability, consensus mechanisms (e.g., Avalanche, Proof-of-Stake), and privacy-enhancing technologies like secure aggregation and untraceable payments. His group develops practical implementations, such as the Thetacrypt threshold cryptography service and analyses of protocols like FastPay and Inter-Blockchain Communication. He has authored over 150 publications in top venues, including the 2021 Principles of Distributed Computing Doctoral Dissertation Award. His work bridges academic theory and real-world applications, addressing challenges in decentralized systems, smart contract security, and blockchain interoperability.
