Simon GuilloudExpertise
My main domains of research are proof assistants and algorithms for logic-related problems.I also have interests in various areas of computer science and mathematics and their applicability in proof systems such as probabilistic proofs, type theory, quantum computing and more.
Expertise
My main domains of research are proof assistants and algorithms for logic-related problems.I also have interests in various areas of computer science and mathematics and their applicability in proof systems such as
Giordano FaviExpertise
Research: Non associative Algebra, Category Theory, Triangulated Category Theory, Balmer-Witt Theory, Quadratic Forms in Characteristic 2, Galois Theory, Essential dimension, Tensor Triangular GeometryTeaching: Algebra (Associative, Linear, Commutative or not), Differential Calculus , Algebraic Geometry/Topology, etc.
Current work
Teaching: My current work at EPFL is half time dedicated to teaching mathematics for 1st year students. It is very important to give satisfactory introductory courses
Thomas Georges Pierre VidickTeaching & PhD PhD Students Itammar Steinberg, Aviv Taller Courses Formal Mathematics with Lean and AI CS-643 This graduate course provides an introduction to using Lean proof assistant to formalize mathematical definitions and theorems. We will have lectures on foundations (formal proofs, dependent type theory), learn about practice (proof tactics, use of AI, etc) and work on a formalization project. Introduction to quantum computation CS-308 The course introduces the para
Florian Karl RichterCurriculum vitae You can download my CV here
ResearchResearch Fields Ergodic Theory, Combinatorics, Number TheoryList of Publications Open-access preprints and e-prints of all my publications are freely available on arXiv ↗ .An inverse theorem for sumsets of sets of positive density in the integersEthan Ackelsberg, Florian K. Richter submitted, 117 pageslink ↗Weighted averages of arithmetic functions and applications to equidistributionVitaly Bergelson, Michael Reilly, Florian K. Richter submitted, 29 page
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 Clément Hongler2006: B.Sc. Math, EPFL2008: M.Sc. Math, EPFL2010: Ph.D. Math, Université de Genève2010-2014: Ritt Assistant Professor, Columbia University2014-2018 Tenure-Track Assistant Professor, EPFL2019-present: Associate Professor, EPFL
Serge VaudenaySerge Vaudenay entered at the Ecole Normale Supérieure in 1989 with a major in mathematics. He earned his agrégation (secondary teaching degree) in mathematics in 1992, then a PhD in Computer Science at the University of Paris 7 - Denis Diderot in 1995. He subsequently became a senior research fellow at the CNRS, prior to being granted his habilitation à diriger des recherches (a postdoctoral degree authorizing the recipient to supervise doctoral students). In 1999, he was appointed as a Professor at the EPFL, where he created the Security and Cryptography Laboratory.
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.
Nicolas MacrisNicolas Macris received the PhD degree in theoretical physics from EPFL and then pursued his scientific activity at the mathematics department of Rutgers University (NJ, USA). He then joined the Faculty of Basic Science of EPFL, working in the field of quantum statistical mechanics and mathematical aspects of the quantum Hall effect. Since 2005 he is with the Communication Theories Laboratory and Information Processing group of the School of Communication and Computer Science and currently works at the interface of statistical mechanics, information theory and error correcting codes, inference and learning theory. He held long-term visiting appointments and collaborations with the University College and the Institute of Advanced studies in Dublin, the Ecole Normale Supérieure de Lyon, the Centre de Physique Theorique Luminy Marseille, Paris XI Orsay, the ETH Zürich and more recently Los Alamos National Lab. CV and publication list.
Annalisa BuffaTeaching & PhD PhD Students Gonzalo Bonilla Moreno, Philipp Christoph Weder, Yannis Dirk Voet, Fabio Marcinno, Ferhat Sindy, Francesco Sala, Markus Renoldner, Mohamed Ben Abdelouahab, Davor Dobrota Past EPFL PhD Students Luca Coradello, Ondine Chanon, Riccardo Puppi Courses Numerical approximation of PDEs MATH-451 The course is about the derivation, theoretical analysis and implementation of the finite element method for the numerical approximation of partial differential equations in on
Johanni Michael BreaTeaching & PhD PhD Students Aude Maier, Lucas Louis Gruaz, Flavio Martinelli Courses Artificial intelligence and society HUM-286 This course integrates social sciences and humanities with engineering sciences, and introduces students to the social, technical and political issues surrounding artificial intelligence. Biological data science II : machine learning BIO-322 Students understand basic concepts and methods of machine learning. They can describe them in mathematical
Wulfram GerstnerWulfram Gerstner is Director of the Laboratory of Computational Neuroscience LCN at the EPFL. His research in computational neuroscience concentrates on models of spiking neurons and spike-timing dependent plasticity, on the problem of neuronal coding in single neurons and populations, as well as on the link between biologically plausible learning rules and behavioral manifestations of learning. He teaches courses for Physicists, Computer Scientists, Mathematicians, and Life Scientists at the EPFL. After studies of Physics in Tübingen and at the Ludwig-Maximilians-University Munich (Master 1989), Wulfram Gerstner spent a year as a visiting researcher in Berkeley. He received his PhD in theoretical physics from the Technical University Munich in 1993 with a thesis on associative memory and dynamics in networks of spiking neurons. After short postdoctoral stays at Brandeis University and the Technical University of Munich, he joined the EPFL in 1996 as assistant professor. Promoted to Associate Professor with tenure in February 2001, he is since August 2006 a full professor with double appointment in the School of Computer and Communication Sciences and the School of Life Sciences. Wulfram Gerstner has been invited speaker at numerous international conferences and workshops. He has served on the editorial board of the Journal of Neuroscience, Network: Computation in Neural Systems', Journal of Computational Neuroscience', and `Science'.
Viktor KuncakViktor Kunčak joined EPFL in 2007, after receiving a PhD degree from MIT. Since then has been leading the Laboratory for Automated Reasoning and Analysis and supervised at least 12 completed PhD theses. His works on languages, algorithms and systems for verification and automated reasoning. He served as an initiator and one of the coordinators of a European network (COST action) in the area of automated reasoning, verification, and synthesis. In 2012 he received a 5-year single-investigator European Research Council (ERC) grant of 1.5M EUR. His invited talks include those at Lambda Days, Scala Days, NFM, LOPSTR, SYNT, ICALP, CSL, RV, VMCAI, and SMT. A paper on test generation he co-authored received an ACM SIGSOFT distinguished paper award at ICSE. A PLDI paper he co-authored was published in the Communications of the ACM as a Research Highlight article. His Google Scholar profile reports an over-approximate H-index of 38. He was an associate editor of ACM Transactions on Programming Languages and Systems (TOPLAS) and served as a co-chair of conferences on Computer-Aided Verification (CAV), Formal Methods in Computer Aided Design (FMCAD), Workshop on Synthesis (SYNT), and Verification, Model Checking, and Abstract Interpretation (VMCAI). At EPFL he teaches courses on functional and parallel programming, compilers, and verification. He has co-taught the MOOC "Parallel Programming" that was visited by over 100'000 learners and completed by thousands of students from all over the world.
Carmela González TroncosoSPRING Lab
Our research focuses on building secure and privacy-preserving systems. We aim to develop tools and methodologies to help engineers embedding strong security and privacy guarantees in their designs, as well as techniques that help them to systematically quantifying the information that an adversary can infer from data she may have access to.More information about our activities here: https://spring.epfl.ch/
Teaching & PhD PhD Students Saiid El Hajj Chehade, Eric Jollès, Christian Knabenhans, Boy David Atienza AlonsoDavid Atienza Alonso is an associate professor of EE and director of the Embedded Systems Laboratory (ESL) at EPFL, Switzerland. He received his MSc and PhD degrees in computer science and engineering from UCM, Spain, and IMEC, Belgium, in 2001 and 2005, respectively. His research interests include system-level design methodologies for multi-processor system-on-chip (MPSoC) servers and edge AI architectures. Dr. Atienza has co-authored more than 350 papers, one book, and 12 patents in these previous areas. He has also received several recognitions and award, among them, the ICCAD 10-Year Retrospective Most Influential Paper Award in 2020, Design Automation Conference (DAC) Under-40 Innovators Award in 2018, the IEEE TCCPS Mid-Career Award in 2018, an ERC Consolidator Grant in 2016, the IEEE CEDA Early Career Award in 2013, the ACM SIGDA Outstanding New Faculty Award in 2012, and a Faculty Award from Sun Labs at Oracle in 2011. He has also earned two best paper awards at the VLSI-SoC 2009 and CST-HPCS 2012 conference, and five best paper award nominations at the DAC 2013, DATE 2013, WEHA-HPCS 2010, ICCAD 2006, and DAC 2004 conferences. He serves or has served as associate editor of IEEE Trans. on Computers (TC), IEEE Design & Test of Computers (D&T), IEEE Trans. on CAD (T-CAD), IEEE Transactions on Sustainable Computing (T-SUSC), and Elsevier Integration. He was the Technical Program Chair of DATE 2015 and General Chair of DATE 2017. He served as President of IEEE CEDA in the period 2018-2019 and was GOLD member of the Board of Governors of IEEE CASS from 2010 to 2012. He is a Distinguished Member of ACM and an IEEE Fellow.
Patrick ThiranPatrick Thiran is a full professor in network and systems theory at the School of Computer and Communication Sciences at EPFL. He holds an electrical engineering degree from the Université Catholique de Louvain, Louvain-la-Neuve, Belgium, an M.Sc. degree in electrical engineering from the University of California at Berkeley, USA, and he received the PhD degree from EPFL, in 1996. He became an adjunct professor in 1998, an assistant professor in 2002, an associate professor in 2006 and a full professor in 2011. He was with Sprint Advanced Technology Labs in Burlingame, California, in 2000-01.
His research interests are in communication and social networks, performance analysis and stochastic models. He is currently active in the analysis and design of wireless and PLC networks (scaling laws, medium access control), in network monitoring (network tomography, multi-layer networks), and data-driven network science. He also contributed to network calculus and to the theory of locally coupled neural networks and self-organizing maps.
He served as an associate editor for the IEEE Transactions on Circuits and Systems in 1997-99 and for the IEEE/ACM Transactions on Networking in 2006-10. He is currently on the editorial board of the IEEE Journal on Selected Areas in Communication. He is/was on the program committee of different conferences in networking, including ACM Sigcomm, Sigmetrics, IMC, CoNext and IEEE Infocom. He was TPC chair of AMC IMC 2011 and CoNext 2012. He is a Fellow of the Belgian American Educational Foundation and of the IEEE. He received the 1996 EPFL Doctoral Prize and the 2008 Crédit Suisse Teaching Award.
Maria ColomboTeaching & PhD PhD Students Roberto Colombo, Antonio Tirotta, Carl Johan Peter Johansson, Giulia Mescolini Past EPFL PhD Students Luigi De Rosa, Silja Noëmi Aline Haffter, Massimo Sorella Courses Analysis IV - Lebesgue measure, Fourier analysis MATH-205 Learn the basis of Lebesgue integration and Fourier analysis Topics on the Euler and Navier-Stokes equations MATH-647 This topics course focuses on recent and classical fundamental results on the Euler and Navier-Stokes equa
Martin JaggiMartin Jaggi is a Tenure Track Assistant Professor at EPFL, heading the Machine Learning and Optimization Laboratory. Before that, he was a post-doctoral researcher at ETH Zurich, at the Simons Institute in Berkeley, and at École Polytechnique in Paris. He has earned his PhD in Machine Learning and Optimization from ETH Zurich in 2011, and a MSc in Mathematics also from ETH Zurich.
Babak FalsafiBabak is a Professor in the School of Computer and Communication Sciences and the founding director of the EcoCloud, an industrial/academic consortium at EPFL investigating scalable data-centric technologies. He has made numerous contributions to computer system design and evaluation including a scalable multiprocessor architecture which was prototyped by Sun Microsystems (now Oracle), snoop filters and memory streaming technologies that are incorporated into IBM BlueGene/P and Q and ARM cores, and computer system performance evaluation methodologies that have been in use by AMD, HP and Google PerKit . He has shown that hardware memory consistency models are neither necessary (in the 90's) nor sufficient (a decade later) to achieve high performance in multiprocessor systems. These results eventually led to fence speculation in modern microprocessors. His latest work on workload-optimized server processors laid the foundation for the first generation of Cavium ARM server CPUs, ThunderX. He is a recipient of an NSF CAREER award, IBM Faculty Partnership Awards, and an Alfred P. Sloan Research Fellowship. He is a fellow of IEEE and ACM.
