MATH-602: Inference on graphsThe class covers topics related to statistical inference and algorithms on graphs: basic random graphs concepts, thresholds, subgraph containment (planted clique), connectivity, broadcasting on trees,
MATH-101(g): Analysis IÉtudier les concepts fondamentaux d'analyse et le calcul différentiel et intégral des fonctions réelles d'une variable.
DH-412: History and the digitalThe course presents a number of computational approaches & tools that can be used to study history. Drawing on case studies from the history of science & technology, the course also offers students th
CS-250: Algorithms IThe students learn the theory and practice of basic concepts and techniques in algorithms. The course covers mathematical induction, techniques for analyzing algorithms, elementary data structures, ma
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-688: Reading group in applied topology IThe focus of this reading group is to delve into the concept of the "Magnitude of Metric Spaces". This approach offers an alternative approach to persistent homology to describe a metric space across