CS-119(a): Information, Computation, CommunicationD'une part, le cours aborde: (1) la notion d'algorithme et de représentation de l'information, (2) l'échantillonnage d'un signal et la compression de données et (3) des aspects
liés aux systèmes: ordinateur, mémoire, etc. D'autre part, le cours donne une i ...
MATH-328: Algebraic geometry I - CurvesAlgebraic geometry is the common language for many branches of modern research in mathematics. This course gives an introduction to this field by studying algebraic curves and their intersection theory. ...
ME-324: Discrete-time control of dynamical systemsOn introduit les bases de l'automatique linéaire discrète qui consiste à appliquer une commande sur des intervalles uniformément espacés. La cadence de l'échantillonnage qui est associée joue un rôle primordial pour assurer la stabilité et la performance d ...
MATH-310: AlgebraThis is an introduction to modern algebra: groups, rings and fields. ...
CS-450: Algorithms IIA first graduate course in algorithms, this course assumes minimal background, but moves rapidly. The objective is to learn the main techniques of algorithm analysis and design, while building a repertory of basic algorithmic solutions to problems in many ...
CS-526: Learning theoryMachine learning and data analysis are becoming increasingly central in many sciences and applications. This course concentrates on the theoretical underpinnings of machine learning. ...
MATH-482: Number theory I.a - Algebraic number theoryAlgebraic number theory is the study of the properties of solutions of polynomial equations with integral coefficients; Starting with concrete problems, we then introduce more general notions like algebraic number fields, algebraic integers, units, ideal c ...
CS-119(l): Information, Computation, CommunicationL'objectif de ce cours est d'introduire les étudiants à la pensée algorithmique, de les familiariser avec les fondamentaux de l'Informatique et de développer une première compétence en programmation (langage C++). ...
COM-401: Cryptography and securityThis course introduces the basics of cryptography. We review several types of cryptographic primitives, when it is safe to use them and how to select the appropriate security parameters. We detail how they work and sketch how they can be implemented. ...
MATH-251(c): Numerical analysisLe cours présente des méthodes numériques pour la résolution de problèmes mathématiques comme des systèmes d'équations linéaires ou non linéaires, l'approximation de fonctions, l'intégration et la dérivation, et les équations différentielles. ...
MATH-505: HPC for numerical methods and data analysisThe objective of this course is to provide the necessary background for designing efficient parallel algorithms in scientific computing as well as in the analysis of large volumes of data. The operations considered are the most costly steps at the heart of ...
PHYS-641: Quantum ComputingAfter introducing the foundations of classical and quantum information theory, and quantum measurement, the course will address the theory and practice of digital quantum computing, covering fundamental and advanced topics such as recent quantum algorithms ...
MATH-504: Integer optimisationThe course aims to introduce the basic concepts and results of integer optimization with special emphasis on algorithmic problems on lattices that have proved to be important in theoretical computer science and cryptography during the past 30 years. ...
PHYS-758: Advanced Course on Quantum CommunicationThe aim of this doctoral course by Nicolas Sangouard is to lay the theoretical groundwork that is needed for students to understand how to take advantage of quantum effects for communication technologies and contribute to on-going efforts in this field. ...
MATH-326: Rational quadratic formsGiven a quadratic equation, e.g. x^2 + 2*y^2 = 81, how can we decide whether there is a rational solution (x,y)? This basic question is what the theory of Rational Quadratic Forms is all about. The course gives an introduction and highlights fundamental te ...
MATH-603: Subconvexity, Periods and EquidistributionThis course is a modern exposition of "Duke's Theorems" which describe the distribution of representations of large integers by a fixed ternary quadratic form. It will be the occasion to introduce the students to the adelic language, the theory of automorp ...
