Skip to contentSkip to filters

We use cookies for analytics.

Introduction to Data Structures and Optimization for Fast Algorithms | Richard M. Karp Distinguished Lecture

Tuesday 15:30 Los Angeles (GMT-7)

Recording available

Berkeley, United States

Recording

1 h 9 min

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

matchingmaximum flowminimum cutslinear systemsLinear Programmingcontinuous optimisationdynamic data structuressketching
Show 2 more topics
nearly linear-time algorithmscomputational problems

More from Simons Institute for the Theory of Computing, UC Berkeley

All talks