Free courses from frontend to fullstack and AI
AI Adoption - Drive Business Value and Organizational Impact
Overview
Syllabus
Ran Levi: Topological analysis of neural networks
Maurice Herlihy: Distributed Computing through Combinatorial Topology
Ulrich Bauer: Ripser Efficient computation of Vietoris–Rips persistence barcodes
Michael Kerber: Novel computational perspectives of Persistence
Samuel Mimram: Introduction to Concurrency Theory through Algebraic Topology #1
Ginestra Bianconi: Emergent Network Geometry
Shmuel Weinberger: Descriptive geometry of function spaces
Katharine Turner: Statistical Shape Analysis using the Persistent Homology Transform
Ulrich Bauer: Algebraic perspectives of Persistence
Chad Giusti: Topology convexity and neural networks
Michael Farber: Topology of large random spaces
Dmitry Feichtner-Kozlov: Topology of complexes arising in models for Distributed Computing #1
Martin Raussen: Topological and combinatorial models of directed path spaces
Peter Bubenik: Stabilizing the unstable output of persistent homology computations
Jacek Brodzki: The Geometry of Synchronization Problems and Learning Group Actions
Dmitry Feichtner-Kozlov: Topology of complexes arising in models for Distributed Computing #2
Matthias Reitzner: Poisson U statistics Subgraph and Component Counts in Random Geometric Graphs
Jeremy Dubut: Natural homology computability and Eilenberg Steenrod axioms
Yasu Hiraoka: Limit theorem for persistence diagrams and related topics
Maurice Herlihy: Applying Combinatorial Topology to Byzantine Tasks
Samuel Mimram: Introduction to Concurrency Theory through Algebraic Topology #2
Krzysztof Ziemianski: Directed paths on cubical complexes
Roy Meshulam: High Dimensional Expanders
Roy Meshulam: Sum Complexes and their Applications
Taught by
Hausdorff Center for Mathematics