Mika Tapani GöösWebsite
https://theory.epfl.ch/mika/
Teaching & PhD PhD Students Valentin Imbach, Ziyi Guan, Artur Riazanov, Anastasiia Sofronova, Weiqiang Yuan Past EPFL PhD Students Maystre Gilbert Théodore Courses Computational complexity CS-524 In computational complexity we study the computational resources needed to solve problems and understand the relation between different types of computation. This course advances the students knowledge of computational complexity, and develop an understanding o Vittorio ErbaTeaching & PhD Courses Statistical physics of computation PHYS-512 The students understand tools from the statistical physics of disordered systems, and apply them to study computational and statistical problems in graph theory, discrete optimisation, inference and machine learning.
Lenka ZdeborováLenka Zdeborová is a Professor of Physics and of Computer Science in École Polytechnique Fédérale de Lausanne where she leads the Statistical Physics of Computation Laboratory. She received a PhD in physics from University Paris-Sud and from Charles University in Prague in 2008. She spent two years in the Los Alamos National Laboratory as the Director's Postdoctoral Fellow. Between 2010 and 2020 she was a researcher at CNRS working in the Institute of Theoretical Physics in CEA Saclay, France. In 2014, she was awarded the CNRS bronze medal, in 2016 Philippe Meyer prize in theoretical physics and an ERC Starting Grant, in 2018 the Irène Joliot-Curie prize, in 2021 the Gibbs lectureship of AMS. She is an editorial board member for Journal of Physics A, Physical Review E, Physical Review X, SIMODS, Machine Learning: Science and Technology, and Information and Inference. Lenka's expertise is in applications of concepts from statistical physics, such as advanced mean field methods, replica method and related message-passing algorithms, to problems in machine learning, signal processing, inference and optimization. She enjoys erasing the boundaries between theoretical physics, mathematics and computer science.
Laura GrigoriExpertise
Numerical linear algebra, deterministic and randomized algorithmsHigh performance computing for scientific applicationsHigh dimensional problems and tensor computationsApplications in astrophysics, molecular simulations, etcCombinatorial scientific computingMathematical Software
Teaching & PhD PhD Students Israa Fakih, Zhipeng Xue, Andrea Di Antonio, Mariana Graciela Martinez Aguilar, Guifré Sánchez i Serra Courses Numerical analysis and computational mathematics MATH-456 The cou
Sofia Charlotta OlhedeI am a professor of Statistics at EPFL. I did my PhD in Mathematics at Imperial College London, and graduated in 2003. I was an assistant professor (lecturer) at Imperial College London 2002-2006, and an associate professor (senior lecturer) 2006-2007. In 2007 I moved to University College London and became a full professor. I moved to EPFL in 2019, and in 2018 I became an Institute of Mathematical Statistics Fellow with citation “For seminal contributions to the theory and application of large and heteroge
Alessandro ChiesaAlessandro Chiesa is a faculty member in computer science. He conducts research in complexity theory, cryptography, and security, with a focus on the theoretical foundations and practical implementations of cryptographic proofs that are short and easy to verify. He is a co-author of several zkSNARK libraries, and is a co-inventor of the Zerocash protocol. He has co-founded Zcash and StarkWare Industries. He is a recipient of a Sloan Research Fellowship (2021), an Okawa Foundation Research Grant (2020), and Google Faculty Research Awards (2018 and 2017). He was included in MIT Technology Review's "35 Innovators Under 35" list in 2018.
Oliver JanzerTeaching & PhD PhD Students Rik Sarkar Courses Algebraic methods in combinatorics MATH-526 In this course we study how algebraic methods can be used to solve problems in combinatorics. The main tools used are from linear algebra and from the theory of polynomials. Graph theory MATH-360 The course aims to introduce the basic concepts and results of modern Graph Theory.
Awards European Prize in Combinatorics 2025 British Combinatorial Committee PhD Prize 2022 Smith-Knight
Sayan BiswasExpertise
Decentralized Machine Learning and Federated Learning focusing on Privacy, Fairness, and Personalization; Secure and Trustworthy Distributed Systems; Differential Privacy; Location Privacy.
Sayan Biswas (CV) is a Postdoctoral Researcher in the Scalable Computing Systems (SaCS) lab at EPFL, Switzerland, led by Prof. Anne-Marie Kermarrec. He completed his PhD in Computer Science at INRIA and école Polytechnique in France, under the supervision of Prof. Catuscia Palamidessi. Prior to that, Sayan stud
Mats Julius StensrudTeaching & PhD PhD Students Ignacio Gonzalez Perez, Gellért Géza Perényi, Lorenzo Gasparollo, Julien David Laurendeau Past EPFL PhD Students Matias Janvin, Amit Sawant Courses Causal thinking MATH-352 This course will give a unified presentation of modern methods for causal inference. We focus on concepts, and we will present examples and ideas from various scientific disciplines, including medicine, computer science, engineering, economics and epidemiology. Probability and statistics (
Olga FinkTeaching & PhD PhD Students Han Sun, Leandro Von Krannichfeldt, Keivan Faghih Niresi, Zepeng Zhang, Vinay Sharma, Chenghao Xu, Raffael Pascal Theiler, Kevin Antonio Steiner, Sergei Garmaev, Amaury Wei Past EPFL PhD Students Ismail Nejjar, Mengjie Zhao Courses Data Science for infrastructure condition monitoring CIVIL-332 The course will cover the relevant steps of data-driven infrastructure condition monitoring, starting from data acquisition, going through the steps pre-processing of real
Leonid MoninTeaching & PhD Courses Algebra III - rings and fields MATH-215 This is an introductory course in ring and field theory. Analysis I (English) MATH-101(en) We study the fundamental concepts of analysis, calculus and the integral of real-valued functions of a real variable. Topology III - Homology MATH-323 Homology is one of the most important tools to study topological spaces and it plays an important role in many fields of mathematics. The aim of this course is
Nicolas BoumalTeaching & PhD PhD Students Andreea-Alexandra Musat Past EPFL PhD Students Christopher Criscitiello, Quentin Rebjock Courses Continuous optimization MATH-329 This course introduces students to continuous, nonlinear optimization. We study the theory of optimization with continuous variables (with full proofs), and we analyze and implement important algorithms to solve constrained and unconstrained problems. Linear Algebra MATH-111(e) The purpose of the course is to introduce
