1 h 9 min
Seminar, Hosted by Simons Institute for the Theory of Computing, UC Berkeley
Introduction to Data Structures and Optimization for Fast Algorithms | Richard M. Karp Distinguished Lecture
Stanford University
Recording
Abstract
Aaron Sidford introduces recent advances towards nearly linear-time algorithms for fundamental computational problems. Examples include matching, maximum flow, minimum cuts, linear systems and linear programming. The lecture explains how continuous optimisation, dynamic data structures and sketching interact, often transferring techniques between apparently different settings.
Topics
- matching, search World Wide
- maximum flow, search World Wide
- minimum cuts, search World Wide
- linear systems, broader topic: systems
- continuous optimisation, broader topic: optimisation
- dynamic data structures
- sketching
- nearly linear-time algorithms, broader topic: algorithms
- computational problems, search World Wide