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
Simon GuilloudExpertise
I am a PhD student at EPFL working in the Laboratory of Automated Reasoning and Analysis with Prof. Viktor KunÄak.My main domains of research are proof assistants and algorithms for logic-related problems.
Expertise
I am a PhD student at EPFL working in the Laboratory of Automated Reasoning and Analysis with Prof. Viktor KunÄak.My main domains of research are proof assistants and algorithms for logic-related problems.
Thomas Georges Pierre VidickEnseignement et PhD Doctorant·es actuel·les Itammar Steinberg, Aviv Taller Cours Formal Mathematics with Lean and AI CS-643 Introduction to quantum computation CS-308 Ce cours introduit le paradigme du calcul quantique de facon axiomatique. Le cours introduit les notions de bit quantique, portes logiques et circuits quantiques, traite les principaux algorithmes quantiques, et les codes correcteurs. Le cours est indépendant de COM-309. Introduction to quantum cryptography
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
Maryna ViazovskaEnseignement et PhD Doctorant·es actuel·les Amal Seddas, Matthias Gröbner A dirigé les thèses EPFL de Martin Peter Stoller, Gauthier Leterrier, Nihar Prakash Gargava Cours Discrete mathematics MATH-260(a) Etude des structures et des concepts qui n'utilisent pas la notion de continuité. Théorie des graphes ou étude des ensembles dénombrables sont des exemples de domaines couverts par les mathématiques discrètes. L'accent sera mis sur les structures que les étudiants reverront au cours de le
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öösEnseignement et PhD Doctorant·es actuel·les Valentin Imbach, Ziyi Guan, Artur Riazanov, Anastasiia Sofronova, Weiqiang Yuan A dirigé les thèses EPFL de Maystre Gilbert Théodore Cours Computational complexity CS-524 En théorie de la complexité, nous étudions les ressources nécessaires à résoudre des problèmes et les relations entre différents modèles de calcul.Ce cours donne une meilleure connaissance de la complexité informatique et aborde les questions ouvertes fondamentales.
Afficher plus