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
Agathe Claire Estelle MignonEducation PhD | Architecture 2019 – 2019 Ecole Polytechnique Fédérale – Lausanne, Suisse MSc | Architecture 2014 – 2014 Ecole Polytechnique Fédérale – Lausanne, Suisse Directed by Dietz Dieter ; Gargiani Roberto
Teaching & PhD Courses Digital models AR-114 The objective of the digital modeling course is to learn and manipulate the basic functions of the Rhinoceros 3D assisted design software through the development of a sim
Jo François TaillieuTeaching & PhD PhD Students Julien Heil Courses Architectural Tomography AR-129 This course situates the act of drawing as an act of spatial, constructive and contextual investigation. It introduces 2-D sectional drawing as a sociotechnical tool in architecture with a fundamental role in measuring, understanding and imagining complex and situated spatial conditions. Studio BA3 (Taillieu) AR-201(m) A house is the simple topic of this studio. A matter of simple complexity.
Clément Pit-ClaudelTeaching & PhD PhD Students Yawen Guan, Kacper Feliks Korban, Can Cebeci, Alexandre Pinazza, Shardul Chiplunkar Courses Interactive Theorem Proving Project CS-642 A project-focused introduction to interactive theorem proving. Interactive theorem proving CS-428 A hands-on introduction to interactive theorem proving, computer-checked mathematics, compiler verification, proofs as programs, dependent types, and proof automation.Come learn how to write computer-checked proofs an
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
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.
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 Simon BossoneyTeaching & PhD Courses Algèbre linéaire et géométrie (pour MAN) PREPA-032(a) We present the fundamental notions of linear algebra in the geometric context where they emerged. We will therefore emphasize the dimensions 2 and 3, and insist on the visualisation of classical objects and operations in the plane and in the 3D space. Analysis I (for CMS) PREPA-003(a) This first semester class is an introduction to the basis of differential calculus. Analysis II (for CMS)
Martin OderskyMartin Odersky heads the programming research group at EPFL. His research interests cover fundamental as well as applied aspects of programming languages. They include semantics, type systems, programming language design, and compiler construction. The main focus if his work lies in the integration of object-oriented and functional programming. His research thesis is that the two paradigms are just two sides of the same coin and should be unified as much as possible. To prove this he has experimented a number of language designs, from Pizza to GJ to Functional Nets. He has also influenced the development of Java as a co-designer of Java generics and as the original author of the current javac reference compiler. His current work concentrates on the Scala programming language, which unifies FP and OOP, while staying completely interoperable with Java and .NET.
Martin Odersky got his doctorate from ETHZ, in 1989. He held research positions at the IBM T.J. Watson Research Center from 1989 and at Yale University from 1991. He was then a professor at the University of Karlsruhe from 1993 and at the University of South Australia from 1997. He joined EPFL as full professor in 1999. He is associate editor of the Journal of Functional Programming and member of IFIP WG 2.8. He was conference chair for ICFP 2000, and program chair for ECOOP 2004 as well as ETAPS/CC 2007.
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'.
Show more