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 reper
MATH-502: Distribution and interpolation spacesThe goal of this course is to give an introduction to the theory of distributions and cover the fundamental results of Sobolev spaces including fractional spaces that appear in the interpolation theor
MATH-432: Probability theoryThe course is based on Durrett's text book
Probability: Theory and Examples.
It takes the measure theory approach to probability theory, wherein expectations are simply abstract integrals.
CS-455: Topics in theoretical computer scienceThe students gain an in-depth knowledge of several current and emerging areas of theoretical computer science. The course familiarizes them with advanced techniques, and develops an understanding of f
MATH-100(b): Advanced analysis IDans ce cours, nous étudierons les notions fondamentales de l'analyse réelle, ainsi que le calcul différentiel et intégral pour les fonctions réelles d'une variable réelle.
MATH-302: Functional analysis IConcepts de base de l'analyse fonctionnelle linéaire: opérateurs bornés, opérateurs compacts, théorie spectrale pour les opérateurs symétriques et compacts, le théorème de Hahn-Banach, les théorèmes d
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
MATH-220: Topology I - point set topologyA topological space is a space endowed with a notion of nearness. A metric space is an example of a topological space, where a distance function measures the concept of nearness. Within this abstract
ENG-639: Dynamic programming and optimal controlThis course provides an introduction to stochastic optimal control and dynamic programming (DP), with a variety of engineering
applications. The course focuses on the DP principle of optimality, and i
PHYS-100: Advanced physics I (mechanics)La Physique Générale I (avancée) couvre la mécanique du point et du solide indéformable. Apprendre la mécanique, c'est apprendre à mettre sous forme mathématique un phénomène physique, en modélisant l
PENS-313: Light-timeCe cours s'articule autour de la lumière comme élément structurant de l'espace et du temps, à travers une approche mêlant dynamique solaire, matérialité, construction et empreinte écologique.
CS-451: Distributed algorithmsComputing is nowadays distributed over several machines, in a local IP-like network, a cloud or a P2P network. Failures are common and computations need to proceed despite partial failures of machin
